Maths Olympiad Prep

Library / /400 of 520

Algebra Difficulty 5.7 AIME, harder Prove it

Given a,b,ca, b, c are positive numbers satisfying abc=1abc=1. Prove:
(a1)(c+1)1+bc+c+(b1)(a+1)1+ca+a+(c1)(b+1)1+ab+b0. \begin{array}{l} \frac{(a-1)(c+1)}{1+bc+c}+\frac{(b-1)(a+1)}{1+ca+a}+ \\ \frac{(c-1)(b+1)}{1+ab+b} \geqslant 0 . \end{array}

Solution

Proof Let
a=xy,b=yz,c=zx(x,y,zR+) a=\frac{x}{y}, b=\frac{y}{z}, c=\frac{z}{x}\left(x, y, z \in \mathbf{R}_{+}\right) \text {. }

Then the original inequality
(xy)(z+x)y(x+y+z)0zx+x2yzxyy0(zxy+x2y)2x, \begin{array}{l} \Leftrightarrow \sum \frac{(x-y)(z+x)}{y(x+y+z)} \geqslant 0 \\ \Leftrightarrow \sum \frac{z x+x^{2}-y z-x y}{y} \geqslant 0 \\ \Leftrightarrow \sum\left(\frac{z x}{y}+\frac{x^{2}}{y}\right) \geqslant 2 \sum x, \end{array}

where, “ \sum ” denotes the cyclic sum.
By the AM-GM inequality, we have
zxy=12(zxy+xyz)x,z2x=(z2x+x)xx+y+z. \begin{array}{l} \sum \frac{z x}{y}=\frac{1}{2} \sum\left(\frac{z x}{y}+\frac{x y}{z}\right) \geqslant \sum x, \\ \sum \frac{z^{2}}{x}=\sum\left(\frac{z^{2}}{x}+x\right)-\sum x \geqslant x+y+z . \end{array}

Adding equations (2) and (3) yields equation (1).
Thus, 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.