Let a , b , c be three real positive numbers and a 2 + b 2 + c 2 = 3 . Find the minimum of the expression P = b + 2 c a 2 + c + 2 a b 2 + a + 2 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.
In fact the smaller the value of a+b+c, the lower the minimum. This means that your proof sadly does not work.
Log in to reply
The first result shows that 3 is the tightest upper bound and the second result shows that 3 P is an upper bound (variable).
For P < 1 , we get the tightest upper bound as < 3 which is false. For P ≥ 1 , the bounds are valid and the minimum should be at P = 1 where it provides the tightest upper bound.
Just in case, I'm tagging @Calvin Lin here so that he can check if the solution is correct. To be honest, even I thought that my approach might be flawed.
Nice, I also used Tittu's lemma
Log in to reply
If you agree with the solution, you can upvote it, you know. Just saying.
Problem Loading...
Note Loading...
Set Loading...
Using Titu's Lemma on the positive reals a , b , c , we have,
a 2 + b 2 + c 2 ≥ 1 + 1 + 1 ( a + b + c ) 2 ⟹ ( a + b + c ) 2 ≤ 3 × 3 = 9 ⟹ a + b + c ≤ 3
and equality occurs when a = b = c = 1 .
Now, using Titu's Lemma on P , we have,
P ≥ 3 ( a + b + c ) ( a + b + c ) 2 = 3 a + b + c ⟹ a + b + c ≤ 3 P
From the two results obtained, we can tell that the minimum of P is achieved when 3 P provides the tightest upper bound for ( a + b + c ) which is 3 . Hence, we have,
3 min ( P ) = 3 ⟹ min ( P ) = 1
The minimum can be verified easily using the equality case for Titu's Lemma. The minimum occurs at a = b = c = 1 which was the same for ( a + b + c ) . Hence, the equality cases are matched and the minimum is confirmed to be 1
P.s- I will edit the solution a bit, if necessary, the next day. It's 5:00 AM now and I need to go to sleep.