AlgebraDifficulty 7.4National olympiad, round 2Prove it
Example 7.7a,b,c,d⩾0, no two are zero at the same time, and a+b+c+d=1, prove that E(a,b,c,d)=a+ba+b+cb+c+dc+d+ad⩽23
Solution
Suppose (a,b,c,d) is an extremum point of E. If a,b,c,d are not all zero, then by Fermat's theorem, f(t)=E(a,b+t,c−t,d) must have f′(0)=0. Note that f′(0)=2(c+d)23−c−2d+b+c1−2(a+b)23a
Thus, 2(c+d)23−c−2d+b+c1−2(a+b)23a=0
Similarly, for g(t)=E(a+t,b,c,d−t), we have g′(0)=0, i.e., 2(a+b)23−a−2b+a+d1−2(c+d)23c=0
Therefore, we have a+b1+c+d1=b+c1+a+d1
By the monotonicity of x1+1−x1, we have a+b=b+c or a+b=a+d, i.e., a=c or b=d. By symmetry, assume a=c, the condition becomes a+2b+c=1, at this point E(a,b,a,d)=a+ba+a+bb+a+da+d+ad=a+b+a+d⩽2(a+b+a+d)=2<23
If a,b,c,d include 0, we assume d=0. Then E(a,b,c)=a+ba+b+cb+c⩽a+ba+(b+c)(b+cb+1)=a+ba+1−a+b⩽(a+(1−a+b))(a+ba+1)⩽(1+b)(2−b)⩽2(1+b)+(2−b)=23
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.