Positive reals a , b , and c are such that a + b + c = 3 . Find the maximum value of
a b b c c a
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.
Let us consider b a 's, c b 's and a c 's. Their A. M. is a + b + c a b + b c + c a = 3 a b + b c + c a
And G. M. is a + b + c a b b c c a = 3 a b b c c a
So, 3 a b b c c a ≤ 3 a b + b c + c a
⟹ a b b c c a ≤ ( 3 a b + b c + c a ) 3
Now, ( a − b ) 2 + ( b − c ) 2 + ( c − a ) 2 ≥ 0
⟹ a 2 + b 2 + c 2 ≥ a b + b c + c a
⟹ ( a + b + c ) 2 = a 2 + b 2 + c 2 + 2 ( a b + b c + c a ) ≥ 3 ( a b + b c + c a )
⟹ 9 ≥ 3 ( a b + b c + c a ) ⟹ a b + b c + c a ≤ 3
So a b b c c a ≤ ( 3 3 ) 3 ,
Hence, the maximum value of a b b c c a is 1 .
Consider the value of ln ( a b b c c a ) = a ln b + b ln c + c ln a . We note that ln ( x ) is a concave function. By Jensen's inequality , we have:
a + b + c a ln b + b ln c + c ln a ≤ ln ( a + b + c a b + b c + c a )
By Hölder's inequality :
( a + b + c ) ( b + c + a ) ( 1 + 1 + 1 ) ( 3 ) ( 3 ) ( 3 ) ⟹ a b + b c + c a ≥ ( a b + b c + c a ) 3 ≥ ( a b + b c + c a ) 3 ≤ 3
Therefore,
3 a ln b + b ln c + c ln a ⟹ a ln b + b ln c + c ln a a b b c c a ≤ ln ( 3 3 ) = ln 1 = 0 ≤ 0 ≤ e 0 = 1
Problem Loading...
Note Loading...
Set Loading...
By weighted AM-GM inequality, 3 a b b c c a ≤ 3 a b + b c + c a
Also by rearrangement inequality we have a 2 + b 2 + c 2 ≥ a b + b c + c a .
So 9 = ( a + b + c ) 2 = a 2 + b 2 + c 2 + 2 ( a b + b c + c a ) ≥ 3 ( a b + b c + c a ) , 3 a b + b c + c a ≤ 1
Hence we obtain a b b c c a ≤ ( 3 a b + b c + c a ) 3 ≤ 1 3 = 1
Equality holds when a = b = c = 1