AlgebraDifficulty 7.2National olympiad, round 2Prove it
Let a,b and c be positive real numbers such that min{ab,bc,ca}⩾1. Prove that 3(a2+1)(b2+1)(c2+1)⩽(3a+b+c)2+1
Solution
We first show the following. - Claim. For any positive real numbers x,y with xy⩾1, we have (x2+1)(y2+1)⩽((2x+y)2+1)2 Proof. Note that xy⩾1 implies (2x+y)2−1⩾xy−1⩾0. We find that (x2+1)(y2+1)=(xy−1)2+(x+y)2⩽((2x+y)2−1)2+(x+y)2=((2x+y)2+1)2. Without loss of generality, assume a⩾b⩾c. This implies a⩾1. Let d=3a+b+c. Note that ad=3a(a+b+c)⩾31+1+1=1. Then we can apply (2) to the pair (a,d) and the pair (b,c). We get (a2+1)(d2+1)(b2+1)(c2+1)⩽((2a+d)2+1)2((2b+c)2+1)2 Next, from 2a+d⋅2b+c⩾ad⋅bc⩾1 we can apply (2) again to the pair (2a+d,2b+c). Together with (3), we have (a2+1)(d2+1)(b2+1)(c2+1)⩽((4a+b+c+d)2+1)4=(d2+1)4 Therefore, (a2+1)(b2+1)(c2+1)⩽(d2+1)3, and (1) follows by taking cube root of both sides. Comment. After justifying the Claim, one may also obtain (1) by mixing variables. Indeed, the function involved is clearly continuous, and hence it suffices to check that the condition xy⩾1 is preserved under each mixing step. This is true since whenever ab,bc,ca⩾1, we have 2a+b⋅2a+b⩾ab⩾1 and 2a+b⋅c⩾21+1=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.