Maths Olympiad Prep

Library / /495 of 520

Algebra Difficulty 6.0 AIME, harder Prove it

Four, (15 points) Given that a1,a2,,ana_{1}, a_{2}, \cdots, a_{n} are all positive numbers, for real numbers b1,b2,,bnb_{1}, b_{2}, \cdots, b_{n} and c1,c2,,cnc_{1}, c_{2}, \cdots, c_{n}, it always holds that aici>bi2(i=1,2,,n)a_{i} c_{i}>b_{i}^{2}(i=1,2, \cdots, n). Prove:
(a1+a2++an)(c1+c2++cn)(b1+b2++bn)2. \begin{array}{l} \left(a_{1}+a_{2}+\cdots+a_{n}\right)\left(c_{1}+c_{2}+\cdots+c_{n}\right) \\ \geqslant\left(b_{1}+b_{2}+\cdots+b_{n}\right)^{2} . \end{array}

Solution

Four, Construct nn quadratic functions
fi(x)=aix2+2bix+ci(i=1,2,,n) f_{i}(x)=a_{i} x^{2}+2 b_{i} x+c_{i}(i=1,2, \cdots, n) \text {. }

Since for each ii, we have ai>0,aici>bi2a_{i}>0, a_{i} c_{i}>b_{i}^{2}, i.e., Δi=\Delta_{i}= (2bi)24aici0\left(2 b_{i}\right)^{2}-4 a_{i} c_{i} \leqslant 0, so, fi(x)0f_{i}(x) \geqslant 0, that is
fi(x)=aix2+2bix+ci0(i=1,2,,n). f_{i}(x)=a_{i} x^{2}+2 b_{i} x+c_{i} \geqslant 0(i=1,2, \cdots, n) .

Adding them up, we get f(x)=f1(x)+f2(x)++fn(x)0f(x)=f_{1}(x)+f_{2}(x)+\cdots+f_{n}(x) \geqslant 0,
that is
f(x)=(a1+a2++an)x2+2(b1+b2++bn)x+(c1+c2++cn)0. \begin{aligned} f(x)= & \left(a_{1}+a_{2}+\cdots+a_{n}\right) x^{2}+ \\ & 2\left(b_{1}+b_{2}+\cdots+b_{n}\right) x+ \\ & \left(c_{1}+c_{2}+\cdots+c_{n}\right) \geqslant 0 . \end{aligned}

Since a1+a2++an>0a_{1}+a_{2}+\cdots+a_{n}>0, the parabola opens upwards, and f(x)0f(x) \geqslant 0, so, Δ0\Delta \leqslant 0. Then we have
Δ=[2(b1+b2++bn)]24(a1+a2++an)(c1+c2++cn)0. Hence (a1+a2++an)(c1+c2++cn)(b1+b2++bn)2. \begin{array}{l} \Delta=\left[2\left(b_{1}+b_{2}+\cdots+b_{n}\right)\right]^{2}-4\left(a_{1}+a_{2}+\cdots+\right. \\ \left.\quad a_{n}\right)\left(c_{1}+c_{2}+\cdots+c_{n}\right) \leqslant 0 . \\ \text { Hence }\left(a_{1}+a_{2}+\cdots+a_{n}\right)\left(c_{1}+c_{2}+\cdots+c_{n}\right) \\ \geqslant\left(b_{1}+b_{2}+\cdots+b_{n}\right)^{2} . \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.