If a , b c are positive reals such that a + b + c = 1, what is the minimum value of b + c a 2 + a + c b 2 + a + b c 2 ?
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.
Substitute x 1 = b + c a , x 2 = a + c b , x 1 = a + b c , y 1 = b + c , y 2 = a + c and y 3 = a + b , into the Cauchy-Schwarz inequality. Rearranging gives: 2 a + b + c = 2 1 ≤ ( b + c a 2 + a + c b 2 + a + b c 2 )
by using am gm we come to know equality holds when a=b=c=1/3 apply the value in the expression then problem gets over.
I reported it . am - gm can be applied only when a ,b,c >0 , I too solved it assuming the condition a,b,c>0 @Curtis Clement can you edit your problem
Log in to reply
Well I used the Cauchy - Schwarz inequality, so I'll check if that requires a,b,c> 0
Problem Loading...
Note Loading...
Set Loading...
Solution 1:
Since a + b + c = 1 , we have c y c ∑ b + c a 2 = c y c ∑ 1 − a a 2 let f ( x ) = 1 − x x 2 . Since f ( x ) is a convex function, by Jensen's Inequality, we have f ( 3 a + b + c ) ≤ 3 f ( a ) + f ( b ) + f ( c ) this implies that f ( a ) + f ( b ) + f ( c ) ≥ 3 × 6 1 and hence the minimum value of this expression is 3 × 6 1 = 0 . 5
Solution 2:
By Titu's lemma, we have c y c ∑ b + c a 2 ≥ 2 ( a + b + c ) ( a + b + c ) 2 = 0 . 5