Maths Olympiad Prep

Library / /482 of 520

Algebra Difficulty 7.5 National olympiad, round 2 Prove it

Example 1.17.9. Let a1,a2,,ana_{1}, a_{2}, \ldots, a_{n} be positive real numbers with product 1. Prove that
a1+a2++an+n(n2)(n1)(1a1n1+1a2n1++1ann1)a_{1}+a_{2}+\ldots+a_{n}+n(n-2) \geq(n-1)\left(\frac{1}{\sqrt[n-1]{a_{1}}}+\frac{1}{\sqrt[n-1]{a_{2}}}+\ldots+\frac{1}{\sqrt[n-1]{a_{n}}}\right)

Solution

SOLUTION. The inequality can be rewritten in the form
i=1nai+n(n1)i=1nain(n1)i=1njiajn1\sum_{i=1}^{n} a_{i}+n(n-1) \sqrt[n]{\prod_{i=1}^{n} a_{i}} \geq(n-1) \sum_{i=1}^{n} \sqrt[n-1]{\prod_{j \neq i} a_{j}}

First we will prove the following result (that helps us prove the previous inequality immediately): if x1,x2,,xnx_{1}, x_{2}, \ldots, x_{n} are real numbers then (α)(β)\left(\alpha^{*}\right) \gg\left(\beta^{*}\right) with
(α)=(x1,x2,,xn,x,x,,x)(β)=(y1,y1,,y1,y2,y2,,y2,,yn,yn,,yn)\begin{array}{c} (\alpha)=\left(x_{1}, x_{2}, \ldots, x_{n}, x, x, \ldots, x\right) \\ (\beta)=\left(y_{1}, y_{1}, \ldots, y_{1}, y_{2}, y_{2}, \ldots, y_{2}, \ldots, y_{n}, y_{n}, \ldots, y_{n}\right) \end{array}
where x=1n(x1+x2++xn),(α)x=\frac{1}{n}\left(x_{1}+x_{2}+\ldots+x_{n}\right),(\alpha) includes n(n2)n(n-2) numbers x,(β)x,(\beta) includes n1n-1 numbers yk(k{1,2,,n})y_{k}(\forall k \in\{1,2, \ldots, n\}), and each number bkb_{k} is determined from bk=b_{k}= nxxin1\frac{n x-x_{i}}{n-1}
Indeed, by the symmetric majorization criterion, we only need to prove that
x1+x2++xn+(n2)SSx1+Sx2++Sxn (*) \left|x_{1}\right|+\left|x_{2}\right|+\ldots+\left|x_{n}\right|+(n-2)|S| \geq\left|S-x_{1}\right|+\left|S-x_{2}\right|+\ldots+\left|S-x_{n}\right| \text { (*) }
where S=x1+x2++xn=nxS=x_{1}+x_{2}+\ldots+x_{n}=n x. In the case n=3n=3, this becomes a well-known result
x+y+z+x+y+zx+y+y+z+z+x|x|+|y|+|z|+|x+y+z| \geq|x+y|+|y+z|+|z+x|

In the general case, assume that x1x2xnx_{1} \geq x_{2} \geq \ldots \geq x_{n}. If xiSi{1,2,,n}x_{i} \geq S \forall i \in\{1,2, \ldots, n\} then
 RHS =i=1n(xiS)=(n1)S(n1)Si=1nxi+(n2)S= LHS \text { RHS }=\sum_{i=1}^{n}\left(x_{i}-S\right)=-(n-1) S \leq(n-1)|S| \leq \sum_{i=1}^{n}\left|x_{i}\right|+(n-2)|S|=\text { LHS }
and the conclusion follows. The case xiSi{1,2,,n}x_{i} \leq S \forall i \in\{1,2, \ldots, n\} is proved similarly. We consider the final case. There exists an integer k(1kn1)k(1 \leq k \leq n-1) such that xkSx_{k} \geq S \geq xk+1x_{k+1}. In this case, we can prove ()(\star) simply as follows
RHS=i=1k(xiS)+i=k+1n(Sxi)=i=1kxii=k+1nxk+1+(n2k)S,i=1nxi+(n2k)Si=1nxi+(n2)S= LHS \begin{aligned} \mathrm{RHS}= & \sum_{i=1}^{k}\left(x_{i}-S\right)+\sum_{i=k+1}^{n}\left(S-x_{i}\right)=\sum_{i=1}^{k} x_{i}-\sum_{i=k+1}^{n} x_{k+1}+(n-2 k) S, \\ & \leq \sum_{i=1}^{n}\left|x_{i}\right|+(n-2 k)|S| \leq \sum_{i=1}^{n}\left|x_{i}\right|+(n-2)|S|=\text { LHS } \end{aligned}
which is also the desired result. The problem is completely solved.

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.