Maths Olympiad Prep

Library / /465 of 520

Algebra Difficulty 7.5 National olympiad, round 2 Prove it

Promotion 1 If aiR+(i=1,2,3,,n)a_{i} \in \mathrm{R}^{+}(i=1,2,3, \cdots, n), S=i=1naiS=\sum_{i=1}^{n} a_{i}, and 2nN2 \leqslant n \in \mathrm{N}, prove that i=1nai3Sai1n1i=1nai2\sum_{i=1}^{n} \frac{a_{i}^{3}}{S-a_{i}} \geqslant \frac{1}{n-1} \sum_{i=1}^{n} a_{i}^{2}.

Solution

(Sai)2(n1)[i=1nai2ai2]ai3Sai+ai3Sai+(Sai)2(n1)33(ai3Sai)2(Sai)2(n1)33=3ai2n1,ai3Sai12[3ai2n1(Sai)2(n1)3]12[3ai2n1i=1nai2ai2(n1)2]=12[3(n1)ai2i=1nai2+ai2(n1)2]=12[(3n2)ai2i=1nai2(n1)2], then i=1nai3Sai12[(3n2)i=1nai2ni=1nai2(n1)2]=1n1i=1nai2.\begin{array}{l} \left(S-a_{i}\right)^{2} \leqslant(n-1)\left[\sum_{i=1}^{n} a_{i}^{2}-a_{i}^{2}\right] \\ \because \frac{a_{i}^{3}}{S-a_{i}}+\frac{a_{i}^{3}}{S-a_{i}}+\frac{\left(S-a_{i}\right)^{2}}{(n-1)^{3}} \\ \geqslant 3 \sqrt[3]{\left(\frac{a_{i}^{3}}{S-a_{i}}\right)^{2} \frac{\left(S-a_{i}\right)^{2}}{(n-1)^{3}}}=\frac{3 a_{i}^{2}}{n-1}, \\ \therefore \frac{a_{i}^{3}}{S-a_{i}} \geqslant \frac{1}{2}\left[\frac{3 a_{i}^{2}}{n-1}-\frac{\left(S-a_{i}\right)^{2}}{(n-1)^{3}}\right] \\ \geqslant \frac{1}{2}\left[\frac{3 a_{i}^{2}}{n-1}-\frac{\sum_{i=1}^{n} a_{i}^{2}-a_{i}^{2}}{(n-1)^{2}}\right] \\ =\frac{1}{2}\left[\frac{3(n-1) a_{i}^{2}-\sum_{i=1}^{n} a_{i}^{2}+a_{i}^{2}}{(n-1)^{2}}\right] \\ =\frac{1}{2}\left[\frac{(3 n-2) a_{i}^{2}-\sum_{i=1}^{n} a_{i}^{2}}{(n-1)^{2}}\right], \\ \text { then } \sum_{i=1}^{n} \frac{a_{i}^{3}}{S-a_{i}} \\ \geqslant \frac{1}{2}\left[\frac{(3 n-2) \sum_{i=1}^{n} a_{i}^{2}-n \sum_{i=1}^{n} a_{i}^{2}}{(n-1)^{2}}\right] \\ =\frac{1}{n-1} \sum_{i=1}^{n} a_{i}^{2}. \end{array}

Thus, equation (3) is proved.

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.