Maths Olympiad Prep

Library / /422 of 520

Algebra Difficulty 7.3 National olympiad, round 2 Prove it

Example 6 Let x1,x2,,xnx_{1}, x_{2}, \cdots, x_{n} all be positive numbers (n2)(n \geqslant 2), and i=1nxi=1\sum_{i=1}^{n} x_{i}=1, prove that: i=1nxi1xii=1nxin1\sum_{i=1}^{n} \frac{x_{i}}{\sqrt{1-x_{i}}} \geqslant \frac{\sum_{i=1}^{n} \sqrt{x_{i}}}{\sqrt{n-1}}. (4th CMO Problem)

Solution

Prove that the function f(x)=x1x(0<x<1)f(x)=\frac{x}{\sqrt{1-x}}(0<x<1) is a convex function. For t1,t2>1t_{1}, t_{2}>1, and xi=11ti2(i=1,2)x_{i}=1-\frac{1}{t_{i}^{2}}(i=1,2). Since
12(t1+t2)t1t2,t12+t222t1t2\frac{1}{2}\left(t_{1}+t_{2}\right) \geqslant \sqrt{t_{1} t_{2}}, \sqrt{t_{1}^{2}+t_{2}^{2}} \geqslant \sqrt{2 t_{1} t_{2}}

Thus, 12(t1+t2)2t1t2t12+t22\frac{1}{2}\left(t_{1}+t_{2}\right) \geqslant \frac{\sqrt{2} t_{1} t_{2}}{\sqrt{t_{1}^{2}+t_{2}^{2}}},
which means 12(11x1+11x2)1112(x1+x2)\frac{1}{2}\left(\frac{1}{\sqrt{1-x_{1}}}+\frac{1}{\sqrt{1-x_{2}}}\right) \geqslant \frac{1}{\sqrt{1-\frac{1}{2}\left(x_{1}+x_{2}\right)}}.
Also, (x1x2)(11x111x2)0\left(x_{1}-x_{2}\right)\left(\frac{1}{\sqrt{1-x_{1}}}-\frac{1}{\sqrt{1-x_{2}}}\right) \geqslant 0, hence,
x11x1+x21x212(11x1+11x2)(x1+x2),\frac{x_{1}}{\sqrt{1-x_{1}}}+\frac{x_{2}}{\sqrt{1-x_{2}}} \geqslant \frac{1}{2}\left(\frac{1}{\sqrt{1-x_{1}}}+\frac{1}{\sqrt{1-x_{2}}}\right)\left(x_{1}+x_{2}\right),

Using (1), from (2) we get
12(x11x1+x21x2)12(x1+x2)112(x1+x2)\frac{1}{2}\left(\frac{x_{1}}{\sqrt{1-x_{1}}}+\frac{x_{2}}{\sqrt{1-x_{2}}}\right) \geqslant \frac{\frac{1}{2}\left(x_{1}+x_{2}\right)}{\sqrt{1-\frac{1}{2}\left(x_{1}+x_{2}\right)}}

Equality holds if and only if x1=x2x_{1}=x_{2}. This shows that the function f(x)=x1x(0<x<1)f(x)=\frac{x}{\sqrt{1-x}}(0<x<1) is a convex function. Since f(x)=x(x>0)f(x)=\sqrt{x}(x>0) is also a convex function, we have
1n(x1+x2++xn)x1+x2++xnn=nn.\frac{1}{n}\left(\sqrt{x_{1}}+\sqrt{x_{2}}+\cdots+\sqrt{x_{n}}\right) \leqslant \sqrt{\frac{x_{1}+x_{2}+\cdots+x_{n}}{n}}=\frac{\sqrt{n}}{n} .

From (3) and (4), we obtain the desired inequality.

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.