Olympiad Maths Prep

Track / Stage 7 / 115 of 300 #1515 of 2000

Problem 1515

National olympiad second round; IMO P1/P4
Combinatorics Difficulty 7.2 Prove it

Let En=(a1a2)(a1a3)(a1an)+(a2a1)(a2a3)(a2an)++(ana1)(ana2)(anan1). E_n=(a_1-a_2)(a_1-a_3)\ldots(a_1-a_n)+(a_2-a_1)(a_2-a_3)\ldots(a_2-a_n)+\ldots+(a_n-a_1)(a_n-a_2)\ldots(a_n-a_{n-1}). Let SnS_n be the proposition that En0E_n\ge0 for all real aia_i. Prove that SnS_n is true for n=3n=3 and 55, but for no other n>2n>2.

This one wants a proof. Work it on paper, read the official solution, then mark yourself honestly — the ladder only means something if the record is true.

Official solution

1. **Proving Sn S_n is false for even n n :**

Take a1<0 a_1 < 0 and the remaining ai=0 a_i = 0 for i=2,3,,n i = 2, 3, \ldots, n . Then,
En=(a10)(a10)(a10)+(0a1)(00)(00)++(0a1)(00)(00). E_n = (a_1 - 0)(a_1 - 0) \ldots (a_1 - 0) + (0 - a_1)(0 - 0) \ldots (0 - 0) + \ldots + (0 - a_1)(0 - 0) \ldots (0 - 0).
Simplifying, we get:
En=a1n1+(n1)(a1)0n2=a1n1. E_n = a_1^{n-1} + (n-1)(-a_1) \cdot 0^{n-2} = a_1^{n-1}.
Since a1<0 a_1 < 0 and n1 n-1 is even, a1n1<0 a_1^{n-1} < 0 . Therefore, En<0 E_n < 0 for even n n , and the proposition Sn S_n is false for even n n .

2. **Proving Sn S_n is false for odd n7 n \ge 7 :**

Take any c>a>b c > a > b , and let a1=a a_1 = a , a2=a3=a4=b a_2 = a_3 = a_4 = b , and a5=a6==an=c a_5 = a_6 = \ldots = a_n = c . Then,
En=(ab)(ab)(ab)(ac)n4+(ba)(bb)(bb)(bc)n4++(ca)(cb)(cb)(cb). E_n = (a - b)(a - b)(a - b)(a - c)^{n-4} + (b - a)(b - b)(b - b)(b - c)^{n-4} + \ldots + (c - a)(c - b)(c - b)(c - b).
Simplifying, we get:
En=(ab)3(ac)n4+0++0. E_n = (a - b)^3 (a - c)^{n-4} + 0 + \ldots + 0.
Since a>b a > b and a<c a < c , (ab)3>0 (a - b)^3 > 0 and (ac)n4<0 (a - c)^{n-4} < 0 for n7 n \ge 7 . Therefore, En<0 E_n < 0 for odd n7 n \ge 7 , and the proposition Sn S_n is false for odd n7 n \ge 7 .

3. **Proving Sn S_n is true for n=3 n = 3 :**

Assume a1a2a3 a_1 \ge a_2 \ge a_3 . Then,
E3=(a1a2)(a1a3)+(a2a1)(a2a3)+(a3a1)(a3a2). E_3 = (a_1 - a_2)(a_1 - a_3) + (a_2 - a_1)(a_2 - a_3) + (a_3 - a_1)(a_3 - a_2).
The sum of the first two terms is non-negative because a1a3a2a3 a_1 - a_3 \ge a_2 - a_3 . The last term is also non-negative. Hence,
E30. E_3 \ge 0.
Therefore, the proposition Sn S_n is true for n=3 n = 3 .

4. **Proving Sn S_n is true for n=5 n = 5 :**

Assume a1a2a3a4a5 a_1 \ge a_2 \ge a_3 \ge a_4 \ge a_5 . Then,
E5=(a1a2)(a1a3)(a1a4)(a1a5)+(a2a1)(a2a3)(a2a4)(a2a5)++(a5a1)(a5a2)(a5a3)(a5a4). E_5 = (a_1 - a_2)(a_1 - a_3)(a_1 - a_4)(a_1 - a_5) + (a_2 - a_1)(a_2 - a_3)(a_2 - a_4)(a_2 - a_5) + \ldots + (a_5 - a_1)(a_5 - a_2)(a_5 - a_3)(a_5 - a_4).
The sum of the first two terms is:
(a1a2)[(a1a3)(a1a4)(a1a5)(a2a3)(a2a4)(a2a5)]0. (a_1 - a_2)\left[(a_1 - a_3)(a_1 - a_4)(a_1 - a_5) - (a_2 - a_3)(a_2 - a_4)(a_2 - a_5)\right] \ge 0.
The third term is non-negative because the first two factors are non-positive and the last two are non-negative. The sum of the last two terms is:
(a4a5)[(a1a5)(a2a5)(a3a5)(a1a4)(a2a4)(a3a4)]0. (a_4 - a_5)\left[(a_1 - a_5)(a_2 - a_5)(a_3 - a_5) - (a_1 - a_4)(a_2 - a_4)(a_3 - a_4)\right] \ge 0.
Hence,
E50. E_5 \ge 0.
Therefore, the proposition Sn S_n is true for n=5 n = 5 .

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.