Maths Olympiad Prep

Library / /66 of 520

Algebra Difficulty 6.0 AIME, harder Prove it

Example 8 Let positive real numbers x,y,zx, y, z satisfy
x2+y2+z2=1,g=x+y+zxyz.x^{2}+y^{2}+z^{2}=1, g=x+y+z-xyz.

Prove: The minimum value of gg is 1.

Solution

Proof: Since x2+y2+z2=1x^{2}+y^{2}+z^{2}=1, then,
g=x+y+zxyzx+y+z3xyz3xyz33xyz0.\begin{array}{l} g=x+y+z-x y z \\ \geqslant x+y+z-3 x y z \\ \geqslant 3 \sqrt[3]{x y z}-3 x y z \geqslant 0 . \end{array}

Thus, g1g \geqslant 1 is equivalent to (homogenization)
G(x,y,z)=[(x+y+z)(x2+y2+z2)xyz]2(x2+y2+z2)30.\begin{array}{l} G(x, y, z) \\ =\left[(x+y+z)\left(x^{2}+y^{2}+z^{2}\right)-x y z\right]^{2}- \\ \quad\left(x^{2}+y^{2}+z^{2}\right)^{3} \\ \geqslant 0 . \end{array}

Decomposing G(x,y,z)G(x, y, z), we get
G(x,y,z)=2g6,2+2g6,3+8g6,4+8g6,5+12g6,6+37g6,7\begin{array}{l} G(x, y, z) \\ =2 g_{6,2}+2 g_{6,3}+8 g_{6,4}+8 g_{6,5}+ \\ \quad 12 g_{6,6}+37 g_{6,7} \end{array}
0\geqslant 0. This problem is difficult if you don't know the minimum value is 1.

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.