Maths Olympiad Prep

Library / /377 of 520

Algebra Difficulty 7.2 National olympiad, round 2 Prove it

3 Let x1,x2,,xn(n2)x_{1}, x_{2}, \cdots, x_{n}(n \geqslant 2) all be positive numbers, prove:
x12x12+x2x3+x22x22+x3x4++xn12xn12+xnx1+xn2xn2+x1x2n1.\frac{x_{1}^{2}}{x_{1}^{2}+x_{2} x_{3}}+\frac{x_{2}^{2}}{x_{2}^{2}+x_{3} x_{4}}+\cdots+\frac{x_{n-1}^{2}}{x_{n-1}^{2}+x_{n} x_{1}}+\frac{x_{n}^{2}}{x_{n}^{2}+x_{1} x_{2}} \leqslant n-1 .

Solution

3. Let yi=xi+1xi+2xi2(i=1,2,,n,xn+1=x1,xn+2=x2)y_{i}=\frac{x_{i+1} x_{i+2}}{x_{i}^{2}}\left(i=1,2, \cdots, n, x_{n+1}=x_{1}, x_{n+2}=x_{2}\right), then the original inequality is equivalent to
11+y1+11+y2++11+ynn1\frac{1}{1+y_{1}}+\frac{1}{1+y_{2}}+\cdots+\frac{1}{1+y_{n}} \leqslant n-1

From the definition of yiy_{i}, we know that y1y2yn=1y_{1} y_{2} \cdots y_{n}=1.
If there are two terms in (1) 12\leqslant \frac{1}{2}, since 11+yi<1\frac{1}{1+y_{i}}<1, the conclusion is already established.
If only 11+y112\frac{1}{1+y_{1}} \leqslant \frac{1}{2}, i.e., y11,y21,y31,,yn1y_{1} \geqslant 1, y_{2} \leqslant 1, y_{3} \leqslant 1, \cdots, y_{n} \leqslant 1, then
11+y1+11+y211+y1+11+y2y3yn=11+y1+11+1y1=1\frac{1}{1+y_{1}}+\frac{1}{1+y_{2}} \leqslant \frac{1}{1+y_{1}}+\frac{1}{1+y_{2} y_{3} \cdots y_{n}}=\frac{1}{1+y_{1}}+\frac{1}{1+\frac{1}{y_{1}}}=1

Thus, the sum of the first two terms on the left side of (1) 1\leqslant 1, and the remaining n2n-2 terms are all <1<1, so (1) holds.

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.