AlgebraDifficulty 7.1National olympiad, round 2Prove it
Example 9 Let x,y,z≥0,x2+y2+z2=1,g=x+y+z−xyz. (1) Prove that the minimum value of g is 1; (2) Prove or disprove that g≤983 (Note: The above problem was proposed by Professor Huang Yumin).
Solution
(1) Since x2+y2+z2=1, we have x+y+z≥33xyz≥3xyz, so g=x+y+z−xyz>0, and σ12−2σ2=x2+y2+z2=1, which gives g=σ1(σ12−2σ2)−σ3, g≥1⟺(σ13−2σ1σ2−σ3)2≥(σ12−2σ2)3⟺2σ14σ2−8σ12σ22+8σ23−2σ1σ3(σ12−2σ2)+σ32≥0⟺2f0,2(6)+2f0,3(6)+8f0,4(6)+8f1,1(6)+12f1,2(6)+37σ32≥0
It is clear that (3.2.16) holds. Therefore, (3.2.15) holds, and we know that when y=z=0,x=1, g attains its minimum value of 1. (2) Using the same technique, g≤983⟺81(σ13−2σ1σ2−σ3)2≤192(σ12−2σ2)3⟺L9=37f0,1(6)−17f0,2(6)+94f0,3(6)+80f0,4(6)+117f1,1(6)−28f1,2(6)≥0
Since L9≥17(f0,1(6)+f1,1(6)−f0,2(6))+28(f0,4(6)+f1,1(6)−f1,2(6))f0.1(6)+f1,1(6)−f0.2(6)=∑x2(x−y)2(x−z)2≥0f0,4(6)+f1,1(6)−f1,2(6)≥2f0.4(6)f1,1(6)−f1,2(6)≥0
The correctness of (3.2.18) is guaranteed by (3.1.8), so L9≥0,g≤983 holds. Q.E.D.
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.