Maths Olympiad Prep

Library / /175 of 520

Algebra Difficulty 6.3 National olympiad Prove it

Example 11.12 Let a1,a2,,ana_{1}, a_{2}, \cdots, a_{n} be positive real numbers, satisfying
a1+a2++an=1a1+1a2++1ana_{1}+a_{2}+\cdots+a_{n}=\frac{1}{a_{1}}+\frac{1}{a_{2}}+\cdots+\frac{1}{a_{n}}

Prove that
1n1+a1+1n1+a2++1n1+an1\frac{1}{n-1+a_{1}}+\frac{1}{n-1+a_{2}}+\cdots+\frac{1}{n-1+a_{n}} \geqslant 1

Solution

Let bi=1n1+ai,i=1,2,,nb_{i}=\frac{1}{n-1+a_{i}}, i=1,2, \cdots, n, then bin1bib_{i}\frac{n-1}{b_{i}}

Thus,
j×i1(n1)bi1(n1)bj>(n1)1(n1)bibi\sum_{j \times i} \frac{1-(n-1) b_{i}}{1-(n-1) b_{j}}>(n-1) \frac{1-(n-1) b_{i}}{b_{i}}

Summing the above equation for i=1,2,,ni=1,2, \cdots, n,
i=1nji1(n1)bi1(n1)bj>(n1)1(n1)bibi\sum_{i=1}^{n} \sum_{j \neq i} \frac{1-(n-1) b_{i}}{1-(n-1) b_{j}}>(n-1) \sum \frac{1-(n-1) b_{i}}{b_{i}}

That is,
j=1nj×n1(n1)bi1(n1)bj>(n1)1(n1)bibi\sum_{j=1}^{n} \sum_{j \times n} \frac{1-(n-1) b_{i}}{1-(n-1) b_{j}}>(n-1) \sum \frac{1-(n-1) b_{i}}{b_{i}}

By the assumption,
ji(1(n1)bi)(n1)i=1n1(n1)bibi\sum_{j \neq i}\left(1-(n-1) b_{i}\right)(n-1) \sum_{i=1}^{n} \frac{1-(n-1) b_{i}}{b_{i}}

Contradiction! Hence, the original proposition 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.