to prove the original inequality, it suffices to prove +cyc ∑(a6−2a4b2−2a4c2+2a3b32a4bc−2a3b2c−2a3c2b+3a2b2c2)⩾0.
Using the Sum of Squares (S. O. S.) method, it is easy to prove equation (14): ⇔⇔⇔cyc ∑(a6−2a4b2−2a4c2+2a3b3+2a4bc−2a3b2c−2a3c2b+3a2b2c2)⩾0cyc ∑(2a6−4a4b2−4a4c2+4a3b3+4a4bc−4a3b2c−4a3c2b+6a2b2c2)⩾0cyc ∑(a6−a4b2−a2b4+b6)−3cyc ∑(a4b2−2a3b3+a2b4)−cyc ∑(c3a3−c3a2b−c3ab2+c3b3)+2cyc ∑(a4bc−a3b2c−b3a2c+b4ac)−3cyc ∑(a3c2b−2a2b2c2+b3c2a)⩾0cyc ∑(a−b)2((a+b)2(a2+b2)−3a2b2−c3(a+b)+2abc(a+b)−3abc2)⩾0
Assume without loss of generality that a⩾b⩾c, then Sc⩾0, Sb=(a+c)2(a2+c2)−3a2c2−b3(a+c)+2abc(a+c)−3ab2c⩾0,Sb+Sa⩾(a−b)2(a2+b2−c2+ab+ac+bc)⩾0
Therefore, the original inequality is cyc∑(a−b)2Sc⩾Sa(b−c)2+Sb(b−c)2⩾0
In conclusion, the original inequality holds.
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: NuminaMath-1.5,
licensed Apache-2.0.
Statement and solution reproduced as published; topic and difficulty added by this site.