Maths Olympiad Prep

Library / /33 of 70

Algebra Difficulty 8.2 Shortlist Prove it Romania

Let nn be an integer number greater than 22, let x1,x2,,xnx_1, x_2, \dots, x_n be nn positive real numbers such that
i=1n1xi+1=1, \sum_{i=1}^{n} \frac{1}{x_i + 1} = 1,
and let α\alpha be a real number greater than 11. Show that
i=1n1xiα+1n(n1)α+1 \sum_{i=1}^{n} \frac{1}{x_i^{\alpha} + 1} \geq \frac{n}{(n-1)^{\alpha} + 1}

Solution

Let yi=1/(xi+1)y_i = 1/(x_i+1), i=1,2,,ni = 1, 2, \dots, n, so the yiy_i are positive real numbers that add up to 11. Upon substitution, the left-hand member of the required inequality becomes
i=1nyiα(1yi)α+yiα=i=1nyiα(jiyj)α+yiα, \sum_{i=1}^{n} \frac{y_i^{\alpha}}{(1 - y_i)^{\alpha} + y_i^{\alpha}} = \sum_{i=1}^{n} \frac{y_i^{\alpha}}{\left(\sum_{j \neq i} y_j\right)^{\alpha} + y_i^{\alpha}},
the latter on account of y1+y2++yn=1y_1 + y_2 + \dots + y_n = 1. Apply Jensen's inequality to the convex function ttαt \mapsto t^{\alpha}, t>0t > 0, to get
(jiyj)α(n1)α1jiyjα,i=1,2,,n, \left( \sum_{j \neq i} y_j \right)^{\alpha} \le (n-1)^{\alpha-1} \sum_{j \neq i} y_j^{\alpha}, \quad i = 1, 2, \dots, n,
so
i=1nyiα(jiyj)α+yiαi=1nyiα(n1)α1jiyjα+yiα. \sum_{i=1}^{n} \frac{y_i^{\alpha}}{\left(\sum_{j \neq i} y_j\right)^{\alpha} + y_i^{\alpha}} \ge \sum_{i=1}^{n} \frac{y_i^{\alpha}}{(n-1)^{\alpha-1} \sum_{j \neq i} y_j^{\alpha} + y_i^{\alpha}}.
Now write zi=yiαz_i = y_i^{\alpha}, i=1,2,,ni = 1, 2, \dots, n, z=z1+z2++znz = z_1 + z_2 + \dots + z_n and a=(n1)α1a = (n-1)^{\alpha-1} to transform the right-hand member of the above inequality to
i=1nzi(1a)zi+az. \sum_{i=1}^{n} \frac{z_i}{(1-a)z_i + az}.
Finally, notice that the function tt(1a)t+azt \mapsto \frac{t}{(1-a)t + az}, t<az/(a1)t < az/(a-1), is convex, to conclude by Jensen's inequality:
i=1nzi(1a)zi+azn1ni=1nzi(1a)ni=1nzi+az=n(n1)a+1. \sum_{i=1}^{n} \frac{z_i}{(1-a)z_i + az} \ge n \cdot \frac{\frac{1}{n} \sum_{i=1}^{n} z_i}{(1-a)^n \sum_{i=1}^{n} z_i + az} = \frac{n}{(n-1)a+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: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.