Let a , b , c be non-negative reals. Find the maximum value of k such that ( a + b + c ) ( a 1 + b 1 + c 1 ) + a 2 + b 2 + c 2 k ( a b + b c + c a ) ≥ 9 + k . Write your answer to 3 decimal places.
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.
Great solution! I'm surprised that you use such a method.
Log in to reply
Thank you Steven :) Tejs' theorem struck me after a good day of thinking this one out. Great problem buddy.
Log in to reply
Ah... Thanks. I really appreciate the answer. I seriously wanted a new way! :)
Log in to reply
@Steven Jim – Of course! It's a wonderful technique for max/min problems :)
@Zach Abueg I do think you miss a part (not a big one) which is to prove that the inequality always holds true for all a , b , c . Sorry for not mentioning earlier :)
Problem Loading...
Note Loading...
Set Loading...
We employ the u v w method :
⎩ ⎪ ⎨ ⎪ ⎧ a + b + c = 3 u a b + b c + c a = 3 v 2 a b c = w 3
Hence, our inequality shows that f ( w 3 ) ≥ 0 , where f is a decreasing function.
Now, we know that a , b , c are the positive roots to
( x − a ) ( x − b ) ( x − c ) ⟹ x 3 − 3 u x 2 + 3 v 2 x − w 3 ⟹ x 3 − 3 u x 2 + 3 v 2 x = 0 = 0 = w 3
This implies that f ( x ) = x 3 − 3 u x 2 + 3 v 2 x and y = w 3 intersect at three points: ( a , f ( a ) ) , ( b , f ( b ) ) , and ( c , f ( c ) ) .
Assume that a ≤ b ≤ c . Since u 2 ≥ v 2 , we have
f ′ ( x ) = 3 x 2 − 6 x u + 3 v 2 = 3 ( x 2 − 2 x u + v 2 ) = 3 ( x − x 1 ) ( x − x 2 )
Let x 1 ≤ x 2 . We see that x 1 > 0 , and that ( x 1 , f ( x 1 ) ) and ( x 2 , f ( x 2 ) ) are respective maximum and minimum points. Furthermore, w 3 increases and u and v 2 are constants. Thus, w 3 is maximized when the line y = w 3 touches the graph of f , which happens for equality of two variables.
Since our inequality is homogeneous, we can assume that b = c = 1 , which gives
( a + 2 ) ( a 1 + 2 ) − 9 ≥ k ( 1 − a 2 + 2 2 a + 1 )
or
a 2 ( a 2 + 2 ) ≥ k
By AM-GM we have
a 2 ( a 2 + 2 ) = 2 ( a + a 2 ) ≥ 2 ⋅ 2 2 = 4 2