Maths Olympiad Prep

Library / /34 of 45

, 2008

Algebra Difficulty 6.1 National olympiad Prove it Slovenia

Prove that for all positive integers nn and all real numbers x1,x2,,xnx_1, x_2, \dots, x_n the inequality
x12+1+2x22+1++nxn2+1(x1+2x2++nxn)2+n2(n+1)24 \sqrt{x_1^2 + 1} + 2\sqrt{x_2^2 + 1} + \dots + n\sqrt{x_n^2 + 1} \ge \sqrt{(x_1 + 2x_2 + \dots + nx_n)^2 + \frac{n^2(n+1)^2}{4}}
holds.

Solution

We prove the inequality by induction. Obviously, for n=1n=1 the equality holds and for n=2n=2 we have
x12+1+2x22+1(x1+2x2)2+9. \sqrt{x_1^2 + 1} + 2\sqrt{x_2^2 + 1} \ge \sqrt{(x_1 + 2x_2)^2 + 9}.
After squaring both sides we rewrite it as
(x12+1)(x22+1)x1x2+1. \sqrt{(x_1^2 + 1)(x_2^2 + 1)} \ge x_1 x_2 + 1.
If the right-hand side is negative, then the inequality holds, if not, we can square both sides and transform it into (x1x2)20(x_1 - x_2)^2 \ge 0, which is true. So, for n=2n=2 the inequality holds.

Let us assume the inequality holds for nn and prove it for n+1n+1. By induction hypothesis we have
x12+1+2x22+1++nxn2+1(x1+2x2++nxn)2+n2(n+1)24, \sqrt{x_1^2+1} + 2\sqrt{x_2^2+1} + \dots + n\sqrt{x_n^2+1} \ge \sqrt{(x_1+2x_2+\dots+nx_n)^2 + \frac{n^2(n+1)^2}{4}},
so it suffices to show that
(x1+2x2++nxn)2+n2(n+1)24+(n+1)xn+12+1(x1+2x2++nxn+(n+1)xn+1)2+(n+1)2(n+2)24. \begin{aligned} & \sqrt{(x_1 + 2x_2 + \dots + nx_n)^2 + \frac{n^2(n+1)^2}{4}} + (n+1)\sqrt{x_{n+1}^2 + 1} \ge \\ & \ge \sqrt{(x_1 + 2x_2 + \dots + nx_n + (n+1)x_{n+1})^2 + \frac{(n+1)^2(n+2)^2}{4}}. \end{aligned}
This is equivalent to
(x1+2x2++nxn)2+n2(n+1)24+(n+1)2xn+12+(n+1)2++2(n+1)(x1+2x2++nxn)2+n2(n+1)24xn+12+1(x1+2x2++nxn)2+(n+1)2xn+12+2(n+1)xn+1(x1+2x2++nxn)++(n+1)2(n+2)24, \begin{aligned} & (x_1 + 2x_2 + \dots + nx_n)^2 + \frac{n^2(n+1)^2}{4} + (n+1)^2 x_{n+1}^2 + (n+1)^2 + \\ & + 2(n+1)\sqrt{(x_1 + 2x_2 + \dots + nx_n)^2 + \frac{n^2(n+1)^2}{4}} \sqrt{x_{n+1}^2 + 1} \ge \\ & \ge (x_1 + 2x_2 + \dots + nx_n)^2 + (n+1)^2 x_{n+1}^2 + 2(n+1)x_{n+1}(x_1 + 2x_2 + \dots + nx_n) + \\ & \qquad + \frac{(n+1)^2(n+2)^2}{4}, \end{aligned}
and further to
2(x1+2x2++nxn)2+n2(n+1)24xn+12+12xn+1(x1+2x2++nxn)+n(n+1). 2\sqrt{(x_1 + 2x_2 + \dots + nx_n)^2 + \frac{n^2(n+1)^2}{4}} \sqrt{x_{n+1}^2 + 1} \ge 2x_{n+1}(x_1 + 2x_2 + \dots + nx_n) + n(n+1).
If the right-hand side is negative, then the inequality holds. If not, we can square both sides and we get 4(x1+2x2++nxn)2xn+12+4(x1+2x2++nxn)2+n2(n+1)2xn+12+n2(n+1)24xn+12(x1+2x2++nxn)2+n2(n+1)2+4n(n+1)xn+1(x1+2x2++nxn)4(x_1 + 2x_2 + \dots + nx_n)^2 x_{n+1}^2 + 4(x_1 + 2x_2 + \dots + nx_n)^2 + n^2(n+1)^2 x_{n+1}^2 + n^2(n+1)^2 \ge 4x_{n+1}^2(x_1 + 2x_2 + \dots + nx_n)^2 + n^2(n+1)^2 + 4n(n+1)x_{n+1}(x_1 + 2x_2 + \dots + nx_n) and finally
(2(x1+2x2++nxn)n(n+1)xn+1)20. (2(x_1 + 2x_2 + \dots + nx_n) - n(n+1)x_{n+1})^2 \ge 0.
This inequality obviously holds, and the equality holds when
xn+1=2n(n+1)(x1+2x2++nxn). x_{n+1} = \frac{2}{n(n+1)}(x_1 + 2x_2 + \dots + nx_n).
By induction, the equality holds when x1=x2==xn=xn+1x_1 = x_2 = \dots = x_n = x_{n+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 and solution reproduced as published; topic and difficulty added by this site.