9 Given a>1,b>1,c>1, prove: (1) b2−1a5+c2−1b5+a2−1c5⩾62615; (2) b3−1a5+c3−1b5+a3−1c5⩾25350.
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
9. (1) Using the mean inequality, we have b2−1a5+1225(5+15)(b−1)+1225(5−15)(b+1)+182515+182515⩾6125a, hence b2−1a5⩾6125(a−b)+182515.
Similarly, c2−1b5⩾6125(b−c)+182515;a2−1c5⩾6125(c−a)+182515. Adding these inequalities yields the original inequality.
(2) Since (b3−1)(b3−1)(b3−1)×23×23⩽5535⋅b15, we have b3−1⩽253⋅320⋅b5, thus b3−1a5⩾6b55⋅350⋅a5. Similarly, c3−1b5⩾6c55⋅350⋅b5; a3−1c5⩾6a55⋅350⋅c5. Therefore, the left side of the inequality ⩾65350(b5a5+c5b5+a5c5)⩾25⋅350.
Note: The first part (1) can also be solved using a method similar to part (2). Since (b2−1)(b2−1)⋅32⋅32⋅32⩽(52b2)5, we have b2−1⩽25563b5, thus b2−1a5⩾63b5255a5. This makes it easy to prove the original inequality.
Source: NuminaMath-1.5,
licensed Apache-2.0.
Statement and solution reproduced as published; topic, difficulty and ordering added
by this site.