Maths Olympiad Prep

Library / /4 of 5

Algebra Difficulty 6.7 National Olympiad Prove it Italy

Problem:

Consider the inequality
(x1++xn)24(x1x2+x2x3++xnx1). \left(x_{1}+\ldots+x_{n}\right)^{2} \geq 4\left(x_{1} x_{2}+x_{2} x_{3}+\ldots+x_{n} x_{1}\right) .

a. Determine for which n3n \geq 3 it holds for every possible choice of positive real numbers x1,,xnx_{1}, \ldots, x_{n}.

b. Determine for which n3n \geq 3 it holds for every possible choice of real numbers x1,,xnx_{1}, \ldots, x_{n}.

Solution

Solution:

We shall prove that the inequality
- holds for every choice x1,,xnx_{1}, \ldots, x_{n} of positive real numbers if and only if n4n \geq 4;
- holds for every choice x1,,xnx_{1}, \ldots, x_{n} of real numbers if and only if n=4n=4.

We split the proof into several steps.

Step 1. We show that for n=3n=3 the inequality is false, even for triples of positive real numbers. Indeed, setting x1=x2=x3=1x_{1}=x_{2}=x_{3}=1, the left-hand side equals 99 while the right-hand side equals 1212.

Step 2. For n=4n=4 the inequality holds for every choice of real numbers x1,x2,x3,x4x_{1}, x_{2}, x_{3}, x_{4} (positive, negative, or zero).
Indeed, expanding the square and moving everything to the left-hand side we obtain the inequality
x12+x22+x32+x422x1x22x2x32x3x42x4x1+2x1x3+2x2x40 x_{1}^{2}+x_{2}^{2}+x_{3}^{2}+x_{4}^{2}-2 x_{1} x_{2}-2 x_{2} x_{3}-2 x_{3} x_{4}-2 x_{4} x_{1}+2 x_{1} x_{3}+2 x_{2} x_{4} \geq 0
that is
(x1x2+x3x4)20 \left(x_{1}-x_{2}+x_{3}-x_{4}\right)^{2} \geq 0
which is trivially always true.

Step 3. For every n5n \geq 5 there exists at least one choice x1,,xnx_{1}, \ldots, x_{n} of real numbers (not all positive) for which the inequality is false.
Indeed, setting x1=x2=1,x3=0,x4=2,x5==xn=0x_{1}=x_{2}=1, x_{3}=0, x_{4}=-2, x_{5}=\ldots=x_{n}=0 the left-hand side vanishes, while the right-hand side equals 44.

Step 4. For every n4n \geq 4 the inequality holds for every choice x1,,xnx_{1}, \ldots, x_{n} of positive real numbers.
We prove this fact by induction on nn. Suppose the claim holds for n4n \geq 4 and let us prove it for n+1n+1. Let x1,,xn+1x_{1}, \ldots, x_{n+1} be positive real numbers. Note that the inequality does not change if we cyclically permute the numbers x1,,xn+1x_{1}, \ldots, x_{n+1}, and therefore we may assume that x1x_{1} is a number greater than or equal to all the others. From the inequality for nn terms we obtain
(x1++xn1+(xn+xn+1))24(x1x2++xn2xn1++xn1(xn+xn+1)+(xn+xn+1)x1)=4(x1x2++xnxn+1+xn+1x1)+4y \begin{aligned} \left(x_{1}+\cdots+x_{n-1}+\left(x_{n}+x_{n+1}\right)\right)^{2} \geq & 4\left(x_{1} x_{2}+\cdots+x_{n-2} x_{n-1}+\right. \\ & \left.+x_{n-1}\left(x_{n}+x_{n+1}\right)+\left(x_{n}+x_{n+1}\right) x_{1}\right) \\ = & 4\left(x_{1} x_{2}+\cdots+x_{n} x_{n+1}+x_{n+1} x_{1}\right)+4 y \end{aligned}
where y=xn1xn+1+xn(x1xn+1)>0y=x_{n-1} x_{n+1}+x_{n}\left(x_{1}-x_{n+1}\right)>0 by our assumption on x1x_{1}. The inequality 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: MathNet, licensed CC-BY-4.0. Statement translated into English from it; metadata (topic, difficulty) added by this project.