Maths Olympiad Prep

Library / /491 of 520

Algebra Difficulty 7.6 National olympiad, round 2 Prove it

31. If xF,x2,,xnx_{\mathrm{F}}, x_{2}, \cdots, x_{n} are positive real numbers, and x1+x2++xnnx_{1}+x_{2}+\cdots+x_{n} \leqslant n, prove that
x11+(n1)x1+x21+(n1)x2++xn1+(n1)xn1\frac{x_{1}}{1+(n-1) x_{1}}+\frac{x_{2}}{1+(n-1) x_{2}}+\cdots+\frac{x_{n}}{1+(n-1) x_{n}} \leqslant 1
(Strengthened version of a 2004 Singapore Mathematical Olympiad problem)

Solution

31. Since
xi1+(n1)xi=1n11+(n1)xi11+(n1)xi=1n11n111+(n1)xi\begin{array}{c} \frac{x_{i}}{1+(n-1) x_{i}}=\frac{1}{n-1} \cdot \frac{1+(n-1) x_{i}-1}{1+(n-1) x_{i}}= \\ \frac{1}{n-1}-\frac{1}{n-1} \cdot \frac{1}{1+(n-1) x_{i}} \end{array}

Thus,
x11+(n1)x1+x21+(n1)x2++xn1+(n1)xn111+(n1)x1+11+(n1)x2++11+(n1)xn1\begin{array}{l} \frac{x_{1}}{1+(n-1) x_{1}}+\frac{x_{2}}{1+(n-1) x_{2}}+\cdots+\frac{x_{n}}{1+(n-1) x_{n}} \leqslant 1 \Leftrightarrow \\ \frac{1}{1+(n-1) x_{1}}+\frac{1}{1+(n-1) x_{2}}+\cdots+\frac{1}{1+(n-1) x_{n}} \geqslant 1 \end{array}

By the Cauchy-Schwarz inequality, we have
[11+(n1)x1+11+(n1)x2++11+(n1)xn][1+(n1)x1]+[1+(n1)x2]++[1+(n1)xn]}n2\begin{array}{l} {\left[\frac{1}{1+(n-1) x_{1}}+\frac{1}{1+(n-1) x_{2}}+\cdots+\frac{1}{1+(n-1) x_{n}}\right] \cdot} \\ \left.\left[1+(n-1) x_{1}\right]+\left[1+(n-1) x_{2}\right]+\cdots+\left[1+(n-1) x_{n}\right]\right\} \geqslant n^{2} \end{array}

And since x1+x2++xnnx_{1}+x_{2}+\cdots+x_{n} \leqslant n, we have
[1+(n1)x1]+[1+(n1)x2]++[1+(n1)xn]=n+(n1)(x1+x2++xn)n+(n21)n=n2\begin{array}{l} {\left[1+(n-1) x_{1}\right]+\left[1+(n-1) x_{2}\right]+\cdots+\left[1+(n-1) x_{n}\right]=} \\ n+(n-1)\left(x_{1}+x_{2}+\cdots+x_{n}\right) \leqslant n+\left(n^{2}-1\right) n=n^{2} \end{array}

Therefore:
11+(n1)x1+11+(n1)x2++11+(n1)xn1\frac{1}{1+(n-1) x_{1}}+\frac{1}{1+(n-1) x_{2}}+\cdots+\frac{1}{1+(n-1) x_{n}} \geqslant 1

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.