Maths Olympiad Prep

Library / /9 of 11

Algebra Difficulty 6.5 National Olympiad Prove it Spain

Let pp be an odd positive integer. Find all values of the natural numbers n2n \ge 2 for which holds
i=1nji(xixj)p0, \sum_{i=1}^{n} \prod_{j \neq i} (x_i - x_j)^p \geq 0,
where x1,x2,,xnx_1, x_2, \dots, x_n are any real numbers.

Solution

Denote by
fn(x1,x2,,xn)=i=1nji(xixj)p=(x1x2)p(x1x3)p(x1xn)p f_n(x_1, x_2, \dots, x_n) = \sum_{i=1}^{n} \prod_{j \neq i} (x_i - x_j)^p = (x_1 - x_2)^p (x_1 - x_3)^p \dots (x_1 - x_n)^p
+(x2x1)p(x2x3)p(x2xn)p++(xnx1)p(xnx2)p(xnxn1)p +(x_2-x_1)^p(x_2-x_3)^p\dots(x_2-x_n)^p+\dots+(x_n-x_1)^p(x_n-x_2)^p\dots(x_n-x_{n-1})^p
Since f2(x1,x2)=(x1x2)p+(x2x1)p=0f_2(x_1, x_2) = (x_1 - x_2)^p + (x_2 - x_1)^p = 0 for all x1,x2Rx_1, x_2 \in \mathbb{R}, then for n=2n = 2 the statement holds and equality occurs. Let n3n \ge 3. Then
fn(x1,x2,a,a,,a)=(x1x2)p(x1a)p(n2)+(x2x1)p(x2a)p(n2)=(x1x2)p[(x1a)p(n2)(x2a)p(n2)] \begin{aligned} f_n(x_1, x_2, a, a, \dots, a) &= (x_1 - x_2)^p (x_1 - a)^{p(n-2)} + (x_2 - x_1)^p (x_2 - a)^{p(n-2)} \\ &= (x_1 - x_2)^p \left[ (x_1 - a)^{p(n-2)} - (x_2 - a)^{p(n-2)} \right] \end{aligned}
for all x1,x2Rx_1, x_2 \in \mathbb{R}. Observe that fn(x1,x2,a,a,,a)0f_n(x_1, x_2, a, a, \dots, a) \ge 0 when the function ua(x)=(xa)p(n2)u_a(x) = (x - a)^{p(n-2)} is an increasing function. It occurs when p(n2)p(n-2) is an odd number from which follows that nn must be an odd number too.
Now we consider the case when n7n \ge 7 is an odd number. Then, should be
fn(x1,a,a,a,b,,b)=(x1a)3p(x1b)p(n4)0, f_n(x_1, a, a, a, b, \dots, b) = (x_1 - a)^{3p} (x_1 - b)^{p(n-4)} \ge 0,
for all x1,a,bRx_1, a, b \in \mathbb{R}. But, the preceding inequality does not hold when x1=a+b2x_1 = \frac{a+b}{2} and aba \ne b. So, we have to analyze the cases n=3n = 3 and n=5n = 5.
(1) For n=3n = 3 we may suppose WLOG that x1x2x3x_1 \ge x_2 \ge x_3. Let g(x1,x2,x3)=(x3x1)p(x3x2)pg(x_1, x_2, x_3) = (x_3 - x_1)^p (x_3 - x_2)^p and u(x)=(xx3)pu(x) = (x - x_3)^p, xx3x \ge x_3. Then, we have
(i) uu is increasing.
(ii) g(x1,x2,x3)0g(x_1, x_2, x_3) \ge 0.
On account of (i) and (ii), we have that
f(x1,x2,x3)=(x1x2)p[(x1x3)p(x2x3)p]+(x3x1)p(x3x2)p=(x1x2)p[u(x1)u(x2)]+g(x1,x2,x3)0 \begin{aligned} f(x_1, x_2, x_3) &= (x_1 - x_2)^p \left[ (x_1 - x_3)^p - (x_2 - x_3)^p \right] + (x_3 - x_1)^p (x_3 - x_2)^p \\ &= (x_1 - x_2)^p \left[ u(x_1) - u(x_2) \right] + g(x_1, x_2, x_3) \ge 0 \end{aligned}
and the statement holds for n=3n = 3.
(2) For n=5n = 5 we also suppose that x1x2x3x4x5x_1 \ge x_2 \ge x_3 \ge x_4 \ge x_5. Let
h(x1,x2,x3,x4,x5)=(x3x1)p(x3x2)p(x3x4)p(x3x5)p h(x_1, x_2, x_3, x_4, x_5) = (x_3 - x_1)^p (x_3 - x_2)^p (x_3 - x_4)^p (x_3 - x_5)^p
and let v(x)=(xx3)p(xx4)p(xx5)pv(x) = (x - x_3)^p (x - x_4)^p (x - x_5)^p, xx3x \ge x_3 and w(x)=(xx1)p(xx2)p(xx3)pw(x) = (x - x_1)^p (x - x_2)^p (x - x_3)^p, xx3x \le x_3. Observe that h(x1,x2,x3,x4,x5)0h(x_1, x_2, x_3, x_4, x_5) \ge 0 and vv and ww are increasing. Since
f(x1,x2,x3,x4,x5)=(x1x2)p[v(x1)v(x2)]+(x4x5)p[w(x4)w(x5)]+h(x1,x2,x3,x4,x5), \begin{aligned} f(x_1, x_2, x_3, x_4, x_5) &= (x_1 - x_2)^p [v(x_1) - v(x_2)] \\ &\quad + (x_4 - x_5)^p [w(x_4) - w(x_5)] + h(x_1, x_2, x_3, x_4, x_5), \end{aligned}
then f(x1,x2,x3,x4,x5)0f(x_1, x_2, x_3, x_4, x_5) \ge 0. We conclude that the natural numbers for which the statement follows are n=2,n=3n = 2, n = 3 and n=5n = 5, respectively. \square

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 reproduced verbatim; metadata (topic, difficulty) added by this project.