Maths Olympiad Prep

Library / /387 of 520

Algebra Difficulty 7.2 National olympiad, round 2 Prove it

Example 2 Let a,b,ca, b, c be positive numbers, and satisfy abc=1a b c=1, prove:
2(a+1)2+b2+1+2(b+1)2+c2+1+2(c+1)2+a2+11\begin{array}{l} \frac{2}{(a+1)^{2}+b^{2}+1}+\frac{2}{(b+1)^{2}+c^{2}+1}+ \\ \frac{2}{(c+1)^{2}+a^{2}+1} \leqslant 1 \end{array}

Solution

2(a+1)2+b2+1+2(b+1)2+c2+1+2(c+1)2+a2+1=2a2+b2+2a+2+2b2+c2+2b+2+2c2+a2+2c+222ab+2a+2+22bc+2b+2+22ca+2c+2=1ab+a+1+1bc+b+1+1ca+c+1=1.\begin{array}{l} \frac{2}{(a+1)^{2}+b^{2}+1}+\frac{2}{(b+1)^{2}+c^{2}+1} \\ +\frac{2}{(c+1)^{2}+a^{2}+1} \\ =\frac{2}{a^{2}+b^{2}+2 a+2}+\frac{2}{b^{2}+c^{2}+2 b+2} \\ +\frac{2}{c^{2}+a^{2}+2 c+2} \\ \leqslant \frac{2}{2 a b+2 a+2}+\frac{2}{2 b c+2 b+2}+\frac{2}{2 c a+2 c+2} \\ =\frac{1}{a b+a+1}+\frac{1}{b c+b+1}+\frac{1}{c a+c+1} \\ =1 . \end{array}

Prove that using the binary mean inequality x2+y22xyx^{2}+y^{2} \geqslant 2 x y, and the conclusion of problem 2.1, we can obtain
2(a+1)2+b2+1+2(b+1)2+c2+1+2(c+1)2+a2+1=2a2+b2+2a+2+2b2+c2+2b+2+2c2+a2+2c+222ab+2a+2+22bc+2b+2+22ca+2c+2=1ab+a+1+1bc+b+1+1ca+c+1=1.\begin{array}{l} \frac{2}{(a+1)^{2}+b^{2}+1}+\frac{2}{(b+1)^{2}+c^{2}+1} \\ +\frac{2}{(c+1)^{2}+a^{2}+1} \\ =\frac{2}{a^{2}+b^{2}+2 a+2}+\frac{2}{b^{2}+c^{2}+2 b+2} \\ +\frac{2}{c^{2}+a^{2}+2 c+2} \\ \leqslant \frac{2}{2 a b+2 a+2}+\frac{2}{2 b c+2 b+2}+\frac{2}{2 c a+2 c+2} \\ =\frac{1}{a b+a+1}+\frac{1}{b c+b+1}+\frac{1}{c a+c+1} \\ =1 . \end{array}

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: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.