Example 8 Let positive real numbers x,y,z satisfy x2+y2+z2=1,g=x+y+z−xyz.
Prove: The minimum value of g is 1.
Solution
Proof: Since x2+y2+z2=1, then, g=x+y+z−xyz⩾x+y+z−3xyz⩾33xyz−3xyz⩾0.
Thus, g⩾1 is equivalent to (homogenization) G(x,y,z)=[(x+y+z)(x2+y2+z2)−xyz]2−(x2+y2+z2)3⩾0.
Decomposing G(x,y,z), we get G(x,y,z)=2g6,2+2g6,3+8g6,4+8g6,5+12g6,6+37g6,7 ⩾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.