This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
With equality case a = b = c = 3 .
By the Cauchy-Schwarz Inequality, we have: Σ c ( a + 3 ) 2 ≥ a + b + c ( 9 + a + b + c ) 2 Now by the AM-GM inequality: ( 9 + a + b + c ) 2 ≥ 3 6 ( a + b + c ) This gives us a minimum of 3 6 which is achieved when a , b , c = 3 .
Nice solution .
Ahh same solution. I belive this particular version of Cauchy-Schwarz is called Titu's Lemma.
By Cauchy-Schwarz's Inequality, we have Σ c ( a + 3 ) 2 ≥ a + b + c ( a + b + c + 9 ) 2 We have that ( a + b + c + 9 ) 2 = ( a + b + c ) 2 + 1 8 ( a + b + c ) + 8 1 . Thus, we want to minimize a + b + c ( a + b + c ) 2 + 1 8 ( a + b + c ) + 8 1 = ( a + b + c ) + a + b + c 8 1 + 1 8 By AM-GM, we have ( a + b + c ) + a + b + c 8 1 ≥ 1 8 Thus, the minimum value of 3 6 , when a , b , c = 3
Problem Loading...
Note Loading...
Set Loading...
L e t B = 6 ( c a + a b + b c ) a n d C = c a 2 + 9 + a b 2 + 9 + b c 2 + 9 ⇒ A = B + C U s i n g t h e i n e q u a l i t y ( c a + a b + b c ) ≥ 3 w e g e t B ≥ 1 8 U s i n g t h e i n e q u a l i t y x 2 + y 2 ≥ 2 x y w e g e t C ≥ 6 ( c a + a b + b c ) = B ⇒ C ≥ 1 8 ⇒ A ≥ 3 6