⩽ Given a>0,b>0, prove that 2a+ba+a+2bb⩽a+2ba+2a+bb32.
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
Proof: First, prove the left inequality, eliminate the denominator ⇔a(a+2b)+b(2a+b)⩽a(2a+b)+b(a+2b)⇔a(a+2b)+b(2a+b)⩽a(2a+b)+b(a+ 2b) ⇔2ab⩽a2+b2.
Next, prove the right inequality, eliminate the denominator ⇔⩽⇔⩽⇔⇔⇔⇔3a(2a+b)+3b(a+2b)2(2a+b)(a+2b)3a(2a+b)+3b(a+2b)+6ab(2a+b)(a+2b)4(2a+b)(a+2b)3ab(2a+b)(a+2b)⩽a2+b2+7ab9(a+2b)(2a+b)⩽(a2+b2+7ab)24a3b+4ab3⩽a4+b4+6a2b2(a−b)2⩾0.
Source: NuminaMath-1.5,
licensed Apache-2.0.
Statement and solution reproduced as published; topic, difficulty and ordering added
by this site.