Maths Olympiad Prep

Library / /7 of 55

, 2019

Algebra Difficulty 8.0 National olympiad, round 2 Prove it IMO

Let u1,u2,,u2019u_{1}, u_{2}, \ldots, u_{2019} be real numbers satisfying
u1+u2++u2019=0andu12+u22++u20192=1. u_{1}+u_{2}+\cdots+u_{2019}=0 \quad \text{and} \quad u_{1}^{2}+u_{2}^{2}+\cdots+u_{2019}^{2}=1 .
Let a=min(u1,u2,,u2019)a=\min \left(u_{1}, u_{2}, \ldots, u_{2019}\right) and b=max(u1,u2,,u2019)b=\max \left(u_{1}, u_{2}, \ldots, u_{2019}\right). Prove that
ab12019 a b \leqslant-\frac{1}{2019}

Solutions — 2

Solution 1

Let P={i:ui>0}P=\left\{i: u_{i}>0\right\} and N={i:ui0}N=\left\{i: u_{i} \leqslant 0\right\} be the indices of positive and nonpositive elements in the sequence, and let p=Pp=|P| and n=Nn=|N| be the sizes of these sets; then p+n=2019p+n=2019. By the condition i=12019ui=0\sum_{i=1}^{2019} u_{i}=0 we have 0=i=12019ui=iPuiiNui0=\sum_{i=1}^{2019} u_{i}=\sum_{i \in P} u_{i}-\sum_{i \in N}|u_{i}|, so
iPui=iNui. \begin{equation*} \sum_{i \in P} u_{i}=\sum_{i \in N}|u_{i}| . \tag{1} \end{equation*}
After this preparation, estimate the sum of squares of the positive and nonpositive elements as follows:
iPui2iPbui=biPui=biNuibiNa=nab;iNui2iNaui=aiNui=aiPuiaiPb=pab. \begin{align*} & \sum_{i \in P} u_{i}^{2} \leqslant \sum_{i \in P} b u_{i}=b \sum_{i \in P} u_{i}=b \sum_{i \in N}|u_{i}| \leqslant b \sum_{i \in N}|a|=-n a b ; \tag{2}\\ & \sum_{i \in N} u_{i}^{2} \leqslant \sum_{i \in N}|a| \cdot|u_{i}|=|a| \sum_{i \in N}|u_{i}|=|a| \sum_{i \in P} u_{i} \leqslant|a| \sum_{i \in P} b=-p a b . \tag{3} \end{align*}
The sum of these estimates is
1=i=12019ui2=iPui2+iNui2(p+n)ab=2019ab; 1=\sum_{i=1}^{2019} u_{i}^{2}=\sum_{i \in P} u_{i}^{2}+\sum_{i \in N} u_{i}^{2} \leqslant-(p+n) a b=-2019 a b ;
that proves ab12019a b \leqslant \frac{-1}{2019}.

Solution 2

As in the previous solution we conclude that a<0a<0 and b>0b>0.
For every index ii, the number uiu_{i} is a convex combination of aa and bb, so
ui=xia+yibwith some weights 0xi,yi1,with xi+yi=1. u_{i}=x_{i} a+y_{i} b \quad \text{with some weights} \ 0 \leqslant x_{i}, y_{i} \leqslant 1, \text{with} \ x_{i}+y_{i}=1 .
Let X=i=12019xiX=\sum_{i=1}^{2019} x_{i} and Y=i=12019yiY=\sum_{i=1}^{2019} y_{i}. From 0=i=12019ui=i=12019(xia+yib)=aX+bY0=\sum_{i=1}^{2019} u_{i}=\sum_{i=1}^{2019}\left(x_{i} a+y_{i} b\right)=-|a| X+b Y, we get
aX=bY. \begin{equation*} |a| X=b Y . \tag{4} \end{equation*}
From i=12019(xi+yi)=2019\sum_{i=1}^{2019}\left(x_{i}+y_{i}\right)=2019 we have
X+Y=2019 \begin{equation*} X+Y=2019 \tag{5} \end{equation*}
The system of linear equations (4,5)(4,5) has a unique solution:
X=2019ba+b,Y=2019aa+b X=\frac{2019 b}{|a|+b}, \quad Y=\frac{2019|a|}{|a|+b}
Now apply the following estimate to every ui2u_{i}^{2} in their sum:
ui2=xi2a2+2xiyiab+yi2b2xia2+yib2 u_{i}^{2}=x_{i}^{2} a^{2}+2 x_{i} y_{i} a b+y_{i}^{2} b^{2} \leqslant x_{i} a^{2}+y_{i} b^{2}
we obtain that
1=i=12019ui2i=12019(xia2+yib2)=Xa2+Yb2=2019ba+ba2+2019aa+bb2=2019ab=2019ab 1=\sum_{i=1}^{2019} u_{i}^{2} \leqslant \sum_{i=1}^{2019}\left(x_{i} a^{2}+y_{i} b^{2}\right)=X a^{2}+Y b^{2}=\frac{2019 b}{|a|+b}|a|^{2}+\frac{2019|a|}{|a|+b} b^{2}=2019|a| b=-2019 a b
Hence, ab12019a b \leqslant \frac{-1}{2019}.

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.