Suppose that a,b,c>0 such that abc=1. Prove that ab+a5+b5ab+bc+b5+c5bc+ca+c5+a5ca≤1.
This one wants a proof. Work it on paper, read the official solution, then mark
yourself honestly — the ladder only means something if the record is true.
Official solution
1. Applying the Power-Mean Inequality: By the Power-Mean Inequality, we have: 52a5+b5≥2a+b Raising both sides to the power of 5, we get: 2a5+b5≥(2a+b)5
2. Simplifying the Right-Hand Side: We know that: (2a+b)5=(2a+b)4⋅2a+b Using the AM-GM inequality, we have: (2a+b)4≥(4ab)4=ab Therefore: (2a+b)5≥ab⋅2a+b
3. Combining the Inequalities: From the above, we get: 2a5+b5≥ab⋅2a+b Multiplying both sides by 2, we obtain: a5+b5≥ab(a+b)
4. Substituting into the Original Expression: We need to prove: ab+a5+b5ab+bc+b5+c5bc+ca+c5+a5ca≤1 Using the inequality a5+b5≥ab(a+b), we have: ab+a5+b5ab≤ab+ab(a+b)ab=ab(1+a+b)ab=1+a+b1
5. Summing the Cyclic Terms: Similarly, we get: bc+b5+c5bc≤1+b+c1 ca+c5+a5ca≤1+c+a1 Summing these inequalities, we have: 1+a+b1+1+b+c1+1+c+a1≤1
6. **Using the Condition abc=1:** Since abc=1, we can use the fact that the sum of the reciprocals of the terms in the cyclic sum is less than or equal to 1: 1+a+b1+1+b+c1+1+c+a1≤1
Therefore, we have shown that: ab+a5+b5ab+bc+b5+c5bc+ca+c5+a5ca≤1
■
Source: NuminaMath-1.5,
licensed Apache-2.0.
Statement and solution reproduced as published; topic, difficulty and ordering added
by this site.