AlgebraDifficulty 7.3National olympiad, round 2Prove it
28. Given a,b,c>0, and abc=1, prove: b2(c+1)a+c2(a+1)b+a2(b+1)c⩾23. (2005 Romanian Mathematical Olympiad Problem)
Solution
28. Let a=zx,b=xy,c=yz, then b2(c+1)a+c2(a+1)b+a2(b+1)c⩾23⇔yz(y+z)x3+zx(z+x)y3+xy(x+y)z3⩾23⇔xyz(y+z)x4+xyz(z+x)y4+xyz(x+y)z4⩾23. By the Cauchy-Schwarz inequality, we have (y+zx4+z+xy4+x+yz4)[(y+z)+(z+x)+(x+y)]⩾(x2+y2+z2)2
Thus, it suffices to prove (x2+y2+z2)2⩾3xyz(x+y+z)
In fact, (x2+y2+z2)2⩾31(x+y+z)2(x2+y2+z2)=31(x+y+z)(x+y+z)(x2+y2+z2)⩾31(x+y+z)⋅33xyz⋅33(xyz)2=3xyz(x+y+z)
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.