Solution. Let S = a 1 + a 2 + … + a n S=a_{1}+a_{2}+\ldots+a_{n} S = a 1 + a 2 + … + a n . Dividing the inequality to be proven by n n n and taking the square root:
!
On the left side, we have the quadratic mean of n n n positive numbers, which is not greater than the arithmetic mean of these same numbers:
( a 1 a 2 + … + a n ) 2 + ( a 2 a 3 + … + a 1 ) 2 + … ( a n a 1 + … + a n − 1 ) 2 n ≥ ≥ ( a 1 a 2 + … + a n ) + ( a 2 a 3 + … + a 1 ) + … + ( a n a 1 + … + a n − 1 ) n = = ( S − ( a 2 + … + a n ) a 2 + … + a n ) + ( S − ( a 3 + … + a 1 ) a 3 + … + a 1 ) + … + ( S − ( a 1 + … + a n − 1 ) a 1 + … + a n − 1 ) n = = ( S a 2 + … + a n − 1 ) + ( S a 3 + … + a 1 − 1 ) + … ( S a 1 + … + a n − 1 − 1 ) n = = S ⋅ ( 1 a 2 + … + a n + 1 a 3 + … + a 1 + … + 1 a 1 + … + a n − 1 ) − n n = = S ⋅ 1 a 2 + … + a n + 1 a 3 + … + a 1 + … + 1 a 1 + … + a n − 1 n − 1 = S ⋅ A − 1
\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}
n ( a 2 + … + a n a 1 ) 2 + ( a 3 + … + a 1 a 2 ) 2 + … ( a 1 + … + a n − 1 a n ) 2 ≥ ≥ n ( a 2 + … + a n a 1 ) + ( a 3 + … + a 1 a 2 ) + … + ( a 1 + … + a n − 1 a n ) = = n ( a 2 + … + a n S − ( a 2 + … + a n ) ) + ( a 3 + … + a 1 S − ( a 3 + … + a 1 ) ) + … + ( a 1 + … + a n − 1 S − ( a 1 + … + a n − 1 ) ) = = n ( a 2 + … + a n S − 1 ) + ( a 3 + … + a 1 S − 1 ) + … ( a 1 + … + a n − 1 S − 1 ) = = n S ⋅ ( a 2 + … + a n 1 + a 3 + … + a 1 1 + … + a 1 + … + a n − 1 1 ) − n = = S ⋅ n a 2 + … + a n 1 + a 3 + … + a 1 1 + … + a 1 + … + a n − 1 1 − 1 = S ⋅ A − 1
where A A A denotes the resulting complex fraction. Based on the inequality between the arithmetic and harmonic means:
1 A = 1 1 a 2 + … + a n + 1 a 3 + … + a 1 + … + 1 a 1 + … + a n − 1 ≤ ≤ ( a 2 + … + a n ) + ( a 3 + … + a 1 ) + … + ( a 1 + … + a n − 1 ) n = S ⋅ ( n − 1 ) 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}
A 1 = a 2 + … + a n 1 + a 3 + … + a 1 1 + … + a 1 + … + a n − 1 1 1 ≤ ≤ n ( a 2 + … + a n ) + ( a 3 + … + a 1 ) + … + ( a 1 + … + a n − 1 ) = n S ⋅ ( n − 1 )
Thus, A ≥ n S ⋅ ( n − 1 ) A \geq \frac{n}{S \cdot(n-1)} A ≥ S ⋅ ( n − 1 ) n , substituting this back in:
( a 1 a 2 + … + a n ) 2 + ( a 2 a 3 + … + a 1 ) 2 + … + ( a n a 1 + … + a n − 1 ) 2 n ≥ ≥ S ⋅ n S ⋅ ( n − 1 ) − 1 = n − ( n − 1 ) n − 1 = 1 n − 1 .
\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}
n ( a 2 + … + a n a 1 ) 2 + ( a 3 + … + a 1 a 2 ) 2 + … + ( a 1 + … + a n − 1 a n ) 2 ≥ ≥ S ⋅ S ⋅ ( n − 1 ) n − 1 = n − 1 n − ( n − 1 ) = n − 1 1 .
This completes the proof of the statement.