( a + b + c ) ( a 2 + b 2 + c 2 ) + 3 a b c ≥ N ( a + b ) ( a + c ) ( b + c )
If a , b , c and N are positive reals such that the maximum value of N which satisfies the inequality above can be expressed in the form n m , where m and n are coprime positive integers, find the value of m + n .
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.
How is the last inequality obvious (it's not obvious to me)?
Note that
L.H.S. = a 3 + b 3 + c 3 + 3 a b c + s y m ∑ a 2 b
≥ 2 s y m ∑ a 2 b by Schur's inequality
≥ 1 2 a b c by AM-GM inequality.
Equality is attained when a = b = c .
R.H.S. = 2 N a b c + N s y m ∑ a 2 b
≥ 2 N a b c + 6 N a b c by AM-GM inequality
= 8 N a b c
Equality is attained when a = b = c .
Since L.H.S. ≥ R.H.S. ≥ 8 N a b c ,
we have L.H.S. ≥ 8 N a b c .
However, we have already proven that the minimum of L.H.S. is attained at 1 2 a b c .
Therefore 8 N = 1 2 , which simplifies to N = 2 3 .
This gives m = 3 , n = 2 , hence the answer 3 + 2 = 5 .
This solution is non-sensical. Do you see why?
This solution is non-sensical. Do you see why?
Log in to reply
@Calvin Lin I am not quite sure, but I think it has to do with
Since L.H.S. ≥ R.H.S. ≥ 8 N a b c ,
we have L.H.S. ≥ 8 N a b c .
Can you explain why this approach is wrong?
Log in to reply
Depending on your interpretation / thoughts as you were writing it up:
Log in to reply
@Calvin Lin – @Calvin Lin In order to try to understand what has gone wrong, I go over my thought process while solving this question and try to reconstruct the whole argument backwards, starting from the fact that L.H.S. ≥ 1 2 a b c (We know this is true from Schur's + AM-GM). Therefore, if L.H.S. ≥ 8 N a b c , then such greatest N is 8 1 2 = 2 3 .
From L.H.S. ≥ 8 N a b c , we have L.H.S ≥ R.H.S. ≥ 8 N a b c . The first part of the inequality is given in the question while R.H.S. ≥ 8 N a b c is separately proven above .
Therefore, we have L.H.S. ≥ R.H.S , or
( a + b + c ) ( a 2 + b 2 + c 2 ) + 3 a b c ≥ N ( a + b ) ( a + c ) ( b + c )
substitute N = 2 3 , the inequality should in theory, hold, and we note that such N is the maximum permitted.
I think the bolded part is fallacious. I committed a logical fallacy while assuming L.H.S ≥ R.H.S. ≥ 8 N a b c implies L.H.S. ≥ R.H.S for all N in the backward proof when in actual fact, the sign of the inequality might flip depending on the value of N . In other words, I cannot assume that the inequality holds, find the maximum N = 2 3 and claim that I have solved the problem.
Similarly, in my original proof (forward proof), I cannot infer from L.H.S ≥ R.H.S. ≥ 8 N a b c that L.H.S. ≥ 8 N a b c . Who knows for certain values of N , the inequality flips to R.H.S. ≥ 8 N a b c ≥ L.H.S.
Now that I have noticed this, this fallacy is indeed quite dangerous. While typing up the solution, it didn't even cross my mind that I have assumed things I shouldn't.
What do you think about it? Do I correctly identify the flaw in my proof?
Log in to reply
@Zk Lin – Right, we have shown that L H S ≥ 1 2 a b c and R H S × N ≥ 8 a b c × N . This however does not imply that L H S ≥ 2 3 R H S , since we need to bound the RHS from above, instead of from below.
This is a pretty common mistake made when manipulating such "fractional" inequalities, and not being careful about how we're multiplying / comparing them. That's one reason why Titu's lemma is so powerful, because it helps you make the correct division step.
Sorry, this is incorrect.
We note that:
( a + b ) ( b + c ) ( c + a ) = ( a + b + c ) ( a b + b c + c a ) − a b c
Using Cauchy-Schwarz inequality we have:
a + b + c ≥ 3 ( a b c ) 3 1 and a b + b c + c a ≥ 3 ( a b c ) 3 2
⇒ ( a + b + c ) ( a b + b c + c a ) ≥ 9 a b c ⇒ ( a + b ) ( b + c ) ( c + a ) ≥ 8 a b c
We also note that:
( a b + b c + c a ) 2 a 2 + b 2 + c 2 ( a + b + c ) ( a 2 + b 2 + c 2 ) ( a + b + c ) ( a 2 + b 2 + c 2 ) ( a + b + c ) ( a 2 + b 2 + c 2 ) + 3 a b c ( a + b + c ) ( a 2 + b 2 + c 2 ) + 3 a b c ( a + b + c ) ( a 2 + b 2 + c 2 ) + 3 a b c ≤ ( a 2 + b 2 + c 2 ) ( a 2 + b 2 + c 2 ) ≥ a b + b c + c a ≥ ( a + b + c ) ( a b + b c + c a ) ≥ ( a + b ) ( b + c ) ( c + a ) + a b c ≥ ( a + b ) ( b + c ) ( c + a ) + 4 a b c ≥ ( a + b ) ( b + c ) ( c + a ) + 8 4 ( a + b ) ( b + c ) ( c + a ) ≥ 2 3 ( a + b ) ( b + c ) ( c + a )
⇒ m = 3 , n = 2 and m + n = 5
I don't understand how does the 4th last line imply the 3rd last line. isn't 1/8(a+b)(b+c)(c+a) more than abc?
Log in to reply
You are right. Let me redo the problem.
You should also write the equality cases as each may have been different from one another.
Problem Loading...
Note Loading...
Set Loading...
We suspect that equality occurs when a = b = c , which yield a value of N = 2 3 . Thus, we want to show that
2 [ ( a + b + c ) ( a 2 + b 2 + c 2 ) + 3 a b c ] ≥ 3 ( a + b ) ( b + c ) ( c + a ) .
Expanding both sides and subtracting terms, this is equivalent to
2 a 3 + 2 b 3 + 2 c 3 ≥ a 2 b + b 2 c + c 2 a + a 2 c + b 2 a + c 2 b ,
which is obviously true.