For positive real numbers a, b and c such that a+b+c=abc, prove that cyc∑a2+1a≤32abccyc∑ab+1a3+b3.
Solution
a3+b3≥ab(a+b). So we have ab+1a3+b3≥ab+1ab(a+b) After substitution a=x1, b=y1 and c=z1, it is sufficient to prove that for any positive real numbers x, y and z such that xy+yz+zx=1, we have cyc∑1+x2x≤32xyz1cyc∑1+xyx+y(∗) Since xy+yz+zx=1, for the left hand side we have x2+1x=x2+xy+xz+yzx=(x+y)(x+z)x=(x+y)(y+z)(z+x)x(y+z) And thus, cyc∑1+x2x=(x+y)(y+z)(z+x)1cyc∑(xy+xz)=(x+y)(y+z)(z+x)2 Therefore, (*) is equivalent to (x+y)(y+z)(z+x)2≤32xyz1cyc∑1+xyx+y On the other hand, by Cauchy-Schwarz inequality, we have (1+x2)(1+y2)≥(1+xy)2 and so 32xyz1cyc∑1+xyx+y≥32xyz1cyc∑(1+x2)(1+y2)x+y=32xyz1cyc∑(x+y)2(x+z)(y+z)x+y=2xyz(x+y)(y+z)(z+x)1≥(x+y)(y+z)(z+x)2 The last inequality was true because we have (x+y)(y+z)(z+x)≥8xyz, which is an immediate consequence of AM-GM inequality.
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.