Find the greatest real number M satisfying a3+b3+c3−3abc≥M(ab2+bc2+ca2−3abc) for all positive real numbers a,b,c.
Solution
Since the inequality is cyclic, w.l.o.g. let min{a,b,c}=c. Then a=c+x, b=c+y for some nonnegative x and y. After substitution a=c+x and b=c+y we get a3+b3+c3−3abcab2+bc2+ca2−3abc=(c+x)3+(c+y)3+c3−3(c+x)(c+y)c=(3c+x+y)(x2−xy+y2)=(c+x)(c+y)2+(c+y)c2+c(c+x)2−3(c+x)(c+y)c=(x2−xy+y2)c+xy2 Therefore, in order to prove (∗) we have to show that for each c>0 and x,y≥0 (3−M)(x2−xy+y2)c+x3+y3−Mxy2≥0(1) For x=1, y=32 and any c>0 (3−M)(1−32+34)c+3−34M≥0(2) Now let us show that 3≥34M. Suppose that 3<34M. If 3−M≤0 then (1) is not held for any c>0. If 3−M>0 then for c<(3−M)(1−32+34)34M−3 (2) is not held. Thus, 3−34M≥0. Now let us show that for M=343 the inequality (1) holds. Since M<3, (3−M)(x2−xy+y2)c≥0 and the required result will follow from x3+y3≥Mxy2 which in turn is a consequence of AM-GM inequality: x3+y3=x3+2y3+2y3≥343xy2=Mxy2 Thus, the greatest M is 343.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.
Source: MathNet,
licensed CC-BY-4.0.
Statement reproduced verbatim; metadata (topic, difficulty) added by this project.