Olympiad Maths Prep

Track / Stage 6 / 270 of 400 #1270 of 2000

Problem 1270

National olympiad, first round
Algebra Difficulty 6.5 Prove it

We will prove that for any positive numbers a1,a2,,ana_{1}, a_{2}, \ldots, a_{n}, the following inequality holds:

(a1a2++an)2+(a2a3++a1)2++(ana1++an1)2n(n1)2 \left(\frac{a_{1}}{a_{2}+\ldots+a_{n}}\right)^{2}+\left(\frac{a_{2}}{a_{3}+\ldots+a_{1}}\right)^{2}+\ldots+\left(\frac{a_{n}}{a_{1}+\ldots+a_{n-1}}\right)^{2} \geq \frac{n}{(n-1)^{2}}

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

Solution. Let S=a1+a2++anS=a_{1}+a_{2}+\ldots+a_{n}. Dividing the inequality to be proven by nn and taking the square root:

!

On the left side, we have the quadratic mean of nn positive numbers, which is not greater than the arithmetic mean of these same numbers:

(a1a2++an)2+(a2a3++a1)2+(ana1++an1)2n(a1a2++an)+(a2a3++a1)++(ana1++an1)n==(S(a2++an)a2++an)+(S(a3++a1)a3++a1)++(S(a1++an1)a1++an1)n==(Sa2++an1)+(Sa3++a11)+(Sa1++an11)n==S(1a2++an+1a3++a1++1a1++an1)nn==S1a2++an+1a3++a1++1a1++an1n1=SA1 \begin{aligned} & \sqrt{\frac{\left(\frac{a_{1}}{a_{2}+\ldots+a_{n}}\right)^{2}+\left(\frac{a_{2}}{a_{3}+\ldots+a_{1}}\right)^{2}+\ldots\left(\frac{a_{n}}{a_{1}+\ldots+a_{n-1}}\right)^{2}}{n}} \geq \\ & \geq \frac{\left(\frac{a_{1}}{a_{2}+\ldots+a_{n}}\right)+\left(\frac{a_{2}}{a_{3}+\ldots+a_{1}}\right)+\ldots+\left(\frac{a_{n}}{a_{1}+\ldots+a_{n-1}}\right)}{n}= \\ & =\frac{\left(\frac{S-\left(a_{2}+\ldots+a_{n}\right)}{a_{2}+\ldots+a_{n}}\right)+\left(\frac{S-\left(a_{3}+\ldots+a_{1}\right)}{a_{3}+\ldots+a_{1}}\right)+\ldots+\left(\frac{S-\left(a_{1}+\ldots+a_{n-1}\right)}{a_{1}+\ldots+a_{n-1}}\right)}{n}= \\ & =\frac{\left(\frac{S}{a_{2}+\ldots+a_{n}}-1\right)+\left(\frac{S}{a_{3}+\ldots+a_{1}}-1\right)+\ldots\left(\frac{S}{a_{1}+\ldots+a_{n-1}}-1\right)}{n}= \\ & =\frac{S \cdot\left(\frac{1}{a_{2}+\ldots+a_{n}}+\frac{1}{a_{3}+\ldots+a_{1}}+\ldots+\frac{1}{a_{1}+\ldots+a_{n-1}}\right)-n}{n}= \\ & =S \cdot \frac{\frac{1}{a_{2}+\ldots+a_{n}}+\frac{1}{a_{3}+\ldots+a_{1}}+\ldots+\frac{1}{a_{1}+\ldots+a_{n-1}}}{n}-1=S \cdot A-1 \end{aligned}

where AA denotes the resulting complex fraction. Based on the inequality between the arithmetic and harmonic means:

1A=11a2++an+1a3++a1++1a1++an1(a2++an)+(a3++a1)++(a1++an1)n=S(n1)n \begin{aligned} \frac{1}{A} & =\frac{1}{\frac{1}{a_{2}+\ldots+a_{n}}+\frac{1}{a_{3}+\ldots+a_{1}}+\ldots+\frac{1}{a_{1}+\ldots+a_{n-1}}} \leq \\ & \leq \frac{\left(a_{2}+\ldots+a_{n}\right)+\left(a_{3}+\ldots+a_{1}\right)+\ldots+\left(a_{1}+\ldots+a_{n-1}\right)}{n}=\frac{S \cdot(n-1)}{n} \end{aligned}

Thus, AnS(n1)A \geq \frac{n}{S \cdot(n-1)}, substituting this back in:

(a1a2++an)2+(a2a3++a1)2++(ana1++an1)2nSnS(n1)1=n(n1)n1=1n1. \begin{aligned} & \sqrt{\frac{\left(\frac{a_{1}}{a_{2}+\ldots+a_{n}}\right)^{2}+\left(\frac{a_{2}}{a_{3}+\ldots+a_{1}}\right)^{2}+\ldots+\left(\frac{a_{n}}{a_{1}+\ldots+a_{n-1}}\right)^{2}}{n}} \geq \\ & \geq S \cdot \frac{n}{S \cdot(n-1)}-1=\frac{n-(n-1)}{n-1}=\frac{1}{n-1} . \end{aligned}

This completes the proof of the statement.

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.