Maths Olympiad Prep

Library / /12 of 16

, 2006

Algebra Difficulty 6.9 National olympiad Prove it Czech-Polish-Slovak Mathematical Match

The sum of four real numbers is 99, the sum of their squares is 2121. Prove that these numbers can be signed aa, bb, cc, dd so that inequality abcd2ab - cd \geq 2 holds.

Solution

Let the numbers be pp, qq, rr, ss. Up to a permutation we may assume that pqrsp \geq q \geq r \geq s. We first consider the case where p+q5p+q \geq 5. Then
p2+q2+2pq25=4+(p2+q2+r2+s2)4+p2+q2+2rs, p^2 + q^2 + 2pq \geq 25 = 4 + (p^2 + q^2 + r^2 + s^2) \geq 4 + p^2 + q^2 + 2rs,
which is equivalent to pqrs2pq - rs \geq 2.

Assume now that p+q<5p+q<5; then
4<r+sp+q<5.(1) 4 < r + s \leq p + q < 5. \tag{1}
Observe that
(pq+rs)+(pr+qs)+(ps+qr)=(p+q+r+s)2(p2+q2+r2+s2)2=30. (pq + rs) + (pr + qs) + (ps + qr) = \frac{(p+q+r+s)^2 - (p^2+q^2+r^2+s^2)}{2} = 30.
Moreover,
pq+rspr+qsps+qr, pq + rs \geq pr + qs \geq ps + qr,
because (ps)(qr)0(p-s)(q-r) \geq 0 and (pq)(rs)0(p-q)(r-s) \geq 0.
We conclude that pq+rs10pq + rs \geq 10. From (1), we get 0(p+q)(r+s)<10 \leq (p+q) - (r+s) < 1, therefore
(p+q)22(p+q)(r+s)+(r+s)2<1. (p+q)^2 - 2(p+q)(r+s) + (r+s)^2 < 1.
Adding this to (p+q)2+2(p+q)(r+s)+(r+s)2=92(p+q)^2 + 2(p+q)(r+s) + (r+s)^2 = 9^2 gives
(p+q)2+(r+s)2<41. (p+q)^2 + (r+s)^2 < 41.
Therefore
41=21+210(p2+q2+r2+s2)+2(pq+rs)=(p+q)2+(r+s)2<41, 41 = 21 + 2 \cdot 10 \leq (p^2 + q^2 + r^2 + s^2) + 2(pq + rs) = (p+q)^2 + (r+s)^2 < 41,
which is a contradiction.

Second solution.

From a+b+c+d=9a+b+c+d=9 with ordering abcda \ge b \ge c \ge d we have
a+b2=94+ε1,c+d2=94ε1 \frac{a+b}{2} = \frac{9}{4} + \varepsilon_1, \quad \frac{c+d}{2} = \frac{9}{4} - \varepsilon_1
for some ε10\varepsilon_1 \ge 0. Thus
a=94+ε1+ε2,b=94+ε1ε2,c=94ε1+ε3,d=94ε1ε3 a = \frac{9}{4} + \varepsilon_1 + \varepsilon_2, \quad b = \frac{9}{4} + \varepsilon_1 - \varepsilon_2, \quad c = \frac{9}{4} - \varepsilon_1 + \varepsilon_3, \quad d = \frac{9}{4} - \varepsilon_1 - \varepsilon_3
for some ε2,ε30\varepsilon_2, \varepsilon_3 \ge 0. From bcb \ge c we get
ε1ε2ε1+ε3orε2+ε32ε1. \varepsilon_1 - \varepsilon_2 \geq -\varepsilon_1 + \varepsilon_3 \quad \text{or} \quad \varepsilon_2 + \varepsilon_3 \leq 2\varepsilon_1.
From
21=(a2+b2)+(c2+d2)=2(94+ε1)2+2ε22+2(94ε1)2+2ε32==4(94)2+4ε12+2ε22+2ε32=20+14+2(2ε12+ε22+ε32) 21 = (a^2 + b^2) + (c^2 + d^2) = 2 \cdot \left(\frac{9}{4} + \varepsilon_1\right)^2 + 2\varepsilon_2^2 + 2 \cdot \left(\frac{9}{4} - \varepsilon_1\right)^2 + 2\varepsilon_3^2 = \\ = 4 \cdot \left(\frac{9}{4}\right)^2 + 4\varepsilon_1^2 + 2\varepsilon_2^2 + 2\varepsilon_3^2 = 20 + \frac{1}{4} + 2 \cdot (2\varepsilon_1^2 + \varepsilon_2^2 + \varepsilon_3^2)
we conclude that non-negative numbers εi\varepsilon_i satisfy
2ε12+ε22+ε32=38.(2) 2\varepsilon_1^2 + \varepsilon_2^2 + \varepsilon_3^2 = \frac{3}{8}. \tag{2}
Using ε2+ε32ε1\varepsilon_2 + \varepsilon_3 \le 2\varepsilon_1 and ε22+ε32(ε2+ε3)2\varepsilon_2^2 + \varepsilon_3^2 \le (\varepsilon_2 + \varepsilon_3)^2 from (2) we obtain
382ε12+(ε2+ε3)22ε12+4ε12=6ε12. \frac{3}{8} \leq 2\varepsilon_1^2 + (\varepsilon_2 + \varepsilon_3)^2 \leq 2\varepsilon_1^2 + 4\varepsilon_1^2 = 6\varepsilon_1^2.
Hence ε12(1/6)(3/8)=1/16\varepsilon_1^2 \ge (1/6) \cdot (3/8) = 1/16 or ε11/4\varepsilon_1 \ge 1/4. For abcdab-cd we have
abcd=(94+ε1)2ε22(94ε1)2+ε32=9ε1ε22+ε32. ab - cd = \left(\frac{9}{4} + \varepsilon_1\right)^2 - \varepsilon_2^2 - \left(\frac{9}{4} - \varepsilon_1\right)^2 + \varepsilon_3^2 = 9\varepsilon_1 - \varepsilon_2^2 + \varepsilon_3^2.
Substituting for ε22\varepsilon_2^2 from (2) we get
abcd=9ε1(382ε12ε32)+ε32=9ε1+2ε1238+2ε32914+211638=2. ab - cd = 9\varepsilon_1 - \left(\frac{3}{8} - 2\varepsilon_1^2 - \varepsilon_3^2\right) + \varepsilon_3^2 = 9\varepsilon_1 + 2\varepsilon_1^2 - \frac{3}{8} + 2\varepsilon_3^2 \ge 9 \cdot \frac{1}{4} + 2 \cdot \frac{1}{16} - \frac{3}{8} = 2.
This ends the proof.

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.