AlgebraDifficulty 6.5National OlympiadProve itUnited States
Problem: Let a, b, c, and d be positive real numbers satisfying abcd=1. Prove that 21+a+ab+abc1+21+b+bc+bcd1+21+c+cd+cda1+21+d+da+dab1≥2.
Solution
Solution: Let Sa=a+ab+abcSb=b+bc+bcdSc=c+cd+cdaSd=d+da+dab. Notice that 1+Sa=21+(21+Sa)≥221⋅(21+Sa)=2⋅21+Sa. Using similar relations for Sb, Sc, and Sd we see that the left-hand side of the required inequality is greater than or equal to D=2(1+Sa1+1+Sb1+1+Sc1+1+Sd1). We now have 1+Sa=a+ab+abc+abcd=a⋅(1+Sb)=ab⋅(1+Sc)=abc(1+Sd). Likewise, 1+Sb=bc(1+Sd) and 1+Sc=c(1+Sd), which yields D=2⋅1+Sd1(abc1+bc1+c1+1)=2. Thus the statement is proved.
Choose positive w,x,y,z such that a=wx,b=xy,c=yz,d=zw Then we have 21+a+ab+abc=21+wx+wy+wz=21+wx+y+z=21+w21−w=21⋅w1−w and similarly for the other three terms. Thus each term of the sum has the form 1−w2w.
If 0<x<21, then 1−ww>2w
1−xx>2x Square both sides and multiply by 1−x to get x>4x2(1−x) Dividing by x and simplifying, 0>4x(1−x)−1=−4x2+4x−1 This last expression is −(2x−1)2 which is negative since x<21. (Note that all the steps of this are reversible, so this final true inequality can be used to work backwards and establish our desired inequality.)
Using this result, the original expression is greater than (never equal to) 2⋅(2w+2x+2y+2z)=2
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: MathNet,
licensed CC-BY-4.0.
Statement reproduced verbatim; metadata (topic, difficulty) added by this project.