Prove that for every positive real numbers a, b, c, 1+b1+a2+1+c1+b2+1+a1+c2≥6(2−1).
Solution
Solution 1. Using AM-GM inequality we have 1+b1+a2+1+c1+b2+1+a1+c2≥331+a1+a2⋅1+b1+b2⋅1+c1+c2(1) On the other hand, for every positive real number x, the following inequality holds: 1+x1+x2≥2(2−1).(2) Indeed, the inequality (2) is equivalent to x2−2(2−1)x+1−(22−2)≥0, i.e. x2−2(2−1)x+(2−1)2≥0, and hence (x−(2−1))2≥0. From (1) and (2) we obtain 1+b1+a2+1+c1+b2+1+a1+c2≥338(2−1)3=6(2−1). We have equality if and only if a=b=c=2−1.
Solution 2. The triples (1+a2,1+b2,1+c2)and(1+a1,1+b1,1+c1) have opposite monotony. From the Rearrangement Inequality, it follows cyc∑1+b1+a2≥∑1+a1+a2≥6(2−1), where we have used the inequality (2) in the previous solution.
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 and solution reproduced as published; topic and difficulty added by this site.