Maths Olympiad Prep

Library / /203 of 520

Algebra Difficulty 6.4 National olympiad Prove it

47. Given that a,b,ca, b, c are positive numbers, and 1a2+1+1b2+1+1c2+1=2\frac{1}{a^{2}+1}+\frac{1}{b^{2}+1}+\frac{1}{c^{2}+1}=2, prove: ab+bc+ca32.(2005a b+b c+c a \leqslant \frac{3}{2} .(2005 Iran Mathematical Olympiad problem)

Solution

47. From 1a2+1+1b2+1+1c2+1=2\frac{1}{a^{2}+1}+\frac{1}{b^{2}+1}+\frac{1}{c^{2}+1}=2, we get a2a2+1+b2b2+1+c2c2+1=1\frac{a^{2}}{a^{2}+1}+\frac{b^{2}}{b^{2}+1}+\frac{c^{2}}{c^{2}+1}=1. By the Cauchy-Schwarz inequality, we have
[(a2+1)+(b2+1)+(c2+1)](a2a2+1+b2b2+1+c2c2+1)(a+b+c)2\begin{array}{l} {\left[\left(a^{2}+1\right)+\left(b^{2}+1\right)+\left(c^{2}+1\right)\right] \cdot\left(\frac{a^{2}}{a^{2}+1}+\frac{b^{2}}{b^{2}+1}+\frac{c^{2}}{c^{2}+1}\right) \geqslant} \\ (a+b+c)^{2} \end{array}

That is, a2+b2+c2+3(a+b+c)2a^{2}+b^{2}+c^{2}+3 \geqslant(a+b+c)^{2}, which implies ab+bc+ca32ab+bc+ca \leqslant \frac{3}{2}.

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.