Maths Olympiad Prep

Library / /9 of 30

Algebra Difficulty 8.1 Shortlist Prove it Germany

The real numbers r1,r2,,r2019r_{1}, r_{2}, \ldots, r_{2019} satisfy the conditions r1+r2++r2019=0r_{1}+r_{2}+\ldots+r_{2019}=0 as well as r12+r22++r20192=1r_{1}^{2}+r_{2}^{2}+\ldots+r_{2019}^{2}=1. Let a=min(r1,r2,,r2019)a=\min \left(r_{1}, r_{2}, \ldots, r_{2019}\right) and b=max(r1,r2,,r2019)b=\max \left(r_{1}, r_{2}, \ldots, r_{2019}\right). Prove that: ab12019a b \leq \frac{-1}{2019}.

Solution

Solution:

Since, because of (2), the rir_{i} cannot all be 00, and, because of (1), cannot all have the same sign, we have b>0b>0 and a<0a<0. With P={i:ui>0}P=\left\{i: u_{i}>0\right\} and N={i:ui0}N=\left\{i: u_{i} \leq 0\right\} as well as p=Pp=|P| and n=Nn=|N| we have p+n=2019p+n=2019, and from (1) it follows that

0=i=12019ui=iPuiiNui0=\sum_{i=1}^{2019} u_{i}=\sum_{i \in P} u_{i}-\sum_{i \in N}\left|u_{i}\right|, hence iPui=iNui\sum_{i \in P} u_{i}=\sum_{i \in N}\left|u_{i}\right|.

Thus we can estimate:

iPui2iPbui=biNuibiNa=nab\sum_{i \in P} u_{i}^{2} \leq \sum_{i \in P} b u_{i}=b \sum_{i \in N}\left|u_{i}\right| \leq b \sum_{i \in N}|a|=-n a b \hspace{0.5cm} (3)

as well as

iNui2iNauiaiNui=aiPuipab\sum_{i \in N} u_{i}^{2} \leq \sum_{i \in N} a u_{i} \leq|a| \sum_{i \in N}\left|u_{i}\right|=|a| \sum_{i \in P} u_{i} \leq-p a b \hspace{0.5cm} (4).

It follows that 1=iPui2+iNui2(p+n)ab=2019ab1=\sum_{i \in P} u_{i}^{2}+\sum_{i \in N} u_{i}^{2} \leq-(p+n) a b=-2019 a b, and thus the claim.

Solution 2:

Again starting from b>0b>0 and a<0a<0, we consider the following convex point set CC in the xx-yy-plane:

(i) The lower boundary of CC is the parabola y=x2y=x^{2} in the range axba \leq x \leq b.

(ii) The upper boundary of CC is the line g:y=(a+b)xabg: y=(a+b) x-a b in the range axba \leq x \leq b.

Each of the points (ui,ui2)(u_{i}, u_{i}^{2}) lies on the lower boundary of CC. Therefore the centroid SS of these 20192019 points, each assigned equal mass, also lies in CC. We have S=(12019i=12019ui,12019i=12019ui2)=(0,12019)S=\left(\frac{1}{2019} \sum_{i=1}^{2019} u_{i}, \frac{1}{2019} \sum_{i=1}^{2019} u_{i}^{2}\right)=\left(0, \frac{1}{2019}\right). For gg we have at the point x=0x=0 that y=aby=-a b. SS may not lie above the upper boundary, from which the claim follows.

Solution 3:

(A one-line proof):

0i=12019(ria)(bri)=i=12019(ri2+(b+a)riab)=12019abab120190 \leq \sum_{i=1}^{2019}\left(r_{i}-a\right)\left(b-r_{i}\right)=\sum_{i=1}^{2019}\left(-r_{i}^{2}+(b+a) r_{i}-a b\right)=-1-2019 a b \Leftrightarrow a b \leq \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 translated into English from de; metadata (topic, difficulty) added by this project.