Maths Olympiad Prep

Library / /2 of 4

Algebra Difficulty 6.9 National olympiad Prove it Silk Road Mathematics Competition

Polynomial Q(x)=knxn+kn1xn1++k1x+k0Q(x) = k_n x^n + k_{n-1} x^{n-1} + \dots + k_1 x + k_0 with real coefficients is called mighty if k0=k1+k2++kn1+kn|k_0| = |k_1| + |k_2| + \dots + |k_{n-1}| + |k_n|, and non-increasing if k0k1kn1knk_0 \ge k_1 \ge \dots \ge k_{n-1} \ge k_n.
Let P(x)=adxd+ad1xd1++a1x+a0P(x) = a_d x^d + a_{d-1} x^{d-1} + \dots + a_1 x + a_0 be a polynomial with real non-zero coefficients, such that ad>0a_d > 0 and P(x)(x1)t(x+1)sP(x)(x-1)^t (x+1)^s is mighty for some non-negative integers ss and tt (s+t>0s+t > 0). Prove that at least one of the polynomials P(x)P(x) and (1)dP(x)(-1)^d P(-x) is non-increasing. (Navid Safaei, Iran)

Solution

Note that if for some real numbers x1,x2,,xmx_1, x_2, \dots, x_m the following equality holds:
x1+x2++xm=x1+x2++xm, |x_1| + |x_2| + \dots + |x_m| = |x_1 + x_2 + \dots + x_m|,
then they are of the same sign.
Let
Q(x)=P(x)(x1)t(x+1)s=bnxn+bn1xn1++b0, Q(x) = P(x)(x-1)^t (x+1)^s = b_n x^n + b_{n-1} x^{n-1} + \dots + b_0,
where bn=ad>0b_n = a_d > 0. From the problem statement it follows that
b0=b1+b2++bn. |b_0| = |b_1| + |b_2| + \dots + |b_n|.
Lemma: If t1t \ge 1, then b1,b2,,bn0b_1, b_2, \dots, b_n \ge 0.
Proof:
Q(1)=0    b0+b1++bn=0    b1+b2++bn=b0=b1+b2++bn, \begin{align*} Q(1) = 0 &\implies b_0 + b_1 + \dots + b_n = 0 \\ &\implies |b_1 + b_2 + \dots + b_n| = |b_0| = |b_1| + |b_2| + \dots + |b_n|, \end{align*}
hence, b1,b2,,bnb_1, b_2, \dots, b_n are of the same sign. Since bn>0b_n > 0, then b1,b2,,bn10b_1, b_2, \dots, b_{n-1} \ge 0. We proved the lemma.
Assume that t2t \ge 2. According to the lemma,
b1,b2,,bn10    b1+2b2++nbn>0. b_1, b_2, \dots, b_{n-1} \ge 0 \implies b_1 + 2b_2 + \dots + nb_n > 0.
On the other hand, let R(x)=Q(x)(x1)2R(x) = \frac{Q(x)}{(x-1)^2}. Then
Q(x)=2(x1)R(x)+(x1)2R(x)    Q(1)=0    b1+2b2++nbn=0 Q'(x) = 2(x-1)R(x) + (x-1)^2 R'(x) \implies Q'(1) = 0 \implies b_1 + 2b_2 + \dots + nb_n = 0
— a contradiction. Thus, t1t \le 1.

Similarly, we can show that s1s \le 1. Let's consider three cases.

**I) t=1,s=1t = 1, s = 1**
Q(x)=P(x)(x21)    Q(1)=Q(1)=0    b0+b1++bn=b0b1+b2++(1)nbn=0    b1+b2+b3+=0. \begin{align*} Q(x) = P(x)(x^2 - 1) &\implies Q(1) = Q(-1) = 0 \\ &\implies b_0 + b_1 + \dots + b_n = b_0 - b_1 + b_2 + \dots + (-1)^n b_n = 0 \\ &\implies b_1 + b_2 + b_3 + \dots = 0. \end{align*}
According to the lemma,
b1,b2,,bn0    b1=b2=b3==0, b_1, b_2, \dots, b_n \ge 0 \implies b_1 = b_2 = b_3 = \dots = 0,
— a contradiction, since b1=a1b_1 = -a_1 and by the problem statement a10a_1 \ne 0.

**II) t=1,s=0t = 1, s = 0**
Q(x)=P(x)(x1)=a0+(a0a1)x++(ad1ad)xd+adxd+1. Q(x) = P(x)(x-1) = -a_0 + (a_0 - a_1)x + \dots + (a_{d-1} - a_d)x^d + a_d x^{d+1}.
By the lemma,
a0a1=b10,,ad1ad=bd0    a0a1ad. a_0 - a_1 = b_1 \ge 0, \dots, a_{d-1} - a_d = b_d \ge 0 \implies a_0 \ge a_1 \ge \dots \ge a_d.

Therefore, P(x)P(x) is non-increasing.

**III) t=0,s=1t=0, s=1**.
Q(1)=0    b0b1++(1)nbn=0        b1b2++(1)nbn=b0=b1+b2++(1)nbn. Q(-1) = 0 \implies b_0 - b_1 + \dots + (-1)^n b_n = 0 \implies \\ \implies |b_1 - b_2 + \dots + (-1)^n b_n| = |b_0| = |b_1| + |-b_2| + \dots + |(-1)^n b_n|.
Thus, b1,b2,,(1)nbnb_1, -b_2, \dots, (-1)^n b_n are of the same sign, and since bn>0b_n > 0, then (1)nibi0(-1)^{n-i}b_i \ge 0 for each 1in1 \le i \le n.
Q(x)=P(x)(x+1)=a0+(a0+a1)x++(ad1+ad)xd+adxd+1        (1)d+1i(ai1+ai)0 (for all 1id)        adad1ad2(1)da0. Q(x) = P(x)(x+1) = a_0 + (a_0 + a_1)x + \dots + (a_{d-1} + a_d)x^d + a_d x^{d+1} \implies \\ \implies (-1)^{d+1-i}(a_{i-1} + a_i) \ge 0 \text{ (for all } 1 \le i \le d) \implies \\ \implies a_d \le -a_{d-1} \le a_{d-2} \le \dots \le (-1)^d a_0.
It follows that (1)dP(x)=adxdad1xd1++(1)da0(-1)^d P(-x) = a_d x^d - a_{d-1} x^{d-1} + \dots + (-1)^d a_0 is non-increasing.

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.