uniolympiads Ελληνικά

IMC 2020, Day 1, Problem 4

A polynomial pp with real coefficients satisfies the equation p(x+1)−p(x)=x100p(x+1) - p(x) = x^{100} for all x∈Rx \in \mathbb{R}. Prove that p(1−t)≥p(t)p(1-t) \ge p(t) for 0≤t≤1/20 \le t \le 1/2.

Daniil Klyuev, St. Petersburg State University

Original from the official PDFA polynomial p with real coecients satises the equation p(x + 1) − p(x) = x 100 for all x ∈ R . Prove that p(1 − t) ⩾ p(t) for 0 ⩽ t ⩽ 1/2 . Daniil Klyuev, St. Petersburg State University Problem 4.

This transcription was compared symbol by symbol with the original, but not yet by a person.

Time on this problem 0:00

Work for at least 45 minutes before opening the solution.

Official solution

Daniil Klyuev, St. Petersburg State University

Solution 1. Denote h(z)=p(1−zˉ)−p(z)h(z) = p(1 - \bar{z}) - p(z) for complex zz. For t∈Rt \in \mathbb{R} we have h(it)=p(1+it)−p(it)=t100h(it) = p(1 + it) - p(it) = t^{100}, h(1/2+it)=0h(1/2 + it) = 0.

If p(z)=cnzn+…+c0,cn≠0p(z) = c_n z^n + \ldots + c_0, c_n \neq 0, we have

h(a+it)=p((1−a)+it)−p(a+it)=(1−2a)(ncnin−1tn−1+Q(t,a))h(a + it) = p((1-a) + it) - p(a + it) = (1 - 2a)\left(nc_n i^{n-1} t^{n-1} + Q(t, a)\right)
for some polynomial QQ having degree at most n−2n - 2 with respect to the variable tt. Substituting a=0a = 0 we get n=101n = 101, cn=1/101c_n = 1/101.

Next, for large ∣t∣|t| we see that ℜ(h(a+it))>0\Re(h(a + it)) > 0 for 0⩽a<1/20 \leqslant a < 1/2.

Therefore by Maximum Principle for the harmonic function ℜh\Re h and the rectangle [0,1/2]×[−N,N][0, 1/2] \times [-N, N] for large enough NN we conclude that ℜh\Re h is non-negative in this rectangle, in particular on [0,1/2][0, 1/2], as we need.

Solution 2. Let p(x)=∑j=0majxjp(x) = \sum_{j=0}^m a_j x^j. Then

p(x+1)−p(x)=∑j=0maj((x+1)j−xj)=a1+a2(2x+1)+⋯+am(mxm−1+(m2)xm−2+⋯+1).p(x+1) - p(x) = \sum_{j=0}^m a_j\left((x+1)^j - x^j\right) = a_1 + a_2(2x+1) + \cdots + a_m\left(mx^{m-1} + \binom{m}{2}x^{m-2} + \cdots + 1\right).

This implies that m=101m = 101, mam=1ma_m = 1 so a101=1101a_{101} = \frac{1}{101}, (m−1)am−1+am(m2)=0(m-1)a_{m-1} + a_m\binom{m}{2} = 0 so a100=−12a_{100} = -\frac{1}{2} etc. For j⩾1j \geqslant 1 aja_j is uniquely defined, a0a_0 may be chosen arbitrarily.

The equality p2n(12)=0p_{2n}(\frac{1}{2}) = 0 holds because 0=p2n(12)+p2n(1−12)=2p2n(12)0 = p_{2n}(\frac{1}{2}) + p_{2n}(1 - \frac{1}{2}) = 2p_{2n}(\frac{1}{2}). Let n⩾1n \geqslant 1 be an integer and let pnp_n be a polynomial such that pn(x+1)−pn(x)=xnp_n(x+1) - p_n(x) = x^n for all xx and pn(0)=0=pn(1)p_n(0) = 0 = p_n(1). The above considerations prove the uniqueness of pnp_n. We have p1(x)=12x2−12xp_1(x) = \frac{1}{2}x^2 - \frac{1}{2}x. Also pn′(x+1)−pn′(x)=nxn−1=n(pn−1(x+1)−pn−1(x))p_n'(x+1) - p_n'(x) = nx^{n-1} = n\left(p_{n-1}(x+1) - p_{n-1}(x)\right). Therefore pn′(x)=npn−1(x)+cn−1p_n'(x) = np_{n-1}(x) + c_{n-1} for a properly chosen constant cn−1c_{n-1}. We shall prove that

(1) p2n−1(x)−p2n−1(1−x)=0, p2n(x)+p2n(1−x)=0, c2n=0, p2n′′(x)=2n(2n−1)p2n−2(x)p_{2n-1}(x) - p_{2n-1}(1-x) = 0,\ p_{2n}(x) + p_{2n}(1-x) = 0,\ c_{2n} = 0,\ p_{2n}''(x) = 2n(2n-1)p_{2n-2}(x)

for n=1,2,…n = 1, 2, \ldots and for all xx. Simple computation shows that p1(x)−p1(1−x)=0p_1(x) - p_1(1-x) = 0. We have (p2(x)+p2(1−x))′=2p1(x)+c1−(2p1(1−x)+c1)=0(p_2(x) + p_2(1-x))' = 2p_1(x) + c_1 - (2p_1(1-x) + c_1) = 0 so the map x↦p2(x)+p2(1−x)x \mapsto p_2(x) + p_2(1-x) is constant thus p2(x)+p2(1−x)=p2(0)+p2(1−0)=0p_2(x) + p_2(1-x) = p_2(0) + p_2(1-0) = 0. If the first two equalities hold for some nn then (p2n+1(x)−p2n+1(1−x))′=(2n+1)p2n(x)+c2n+(p2n(1−x)+c2n)=2c2n(p_{2n+1}(x) - p_{2n+1}(1-x))' = (2n+1)p_{2n}(x) + c_{2n} + (p_{2n}(1-x) + c_{2n}) = 2c_{2n} so there exists b∈Rb \in R such that p2n+1(x)−p2n+1(1−x)=2c2nx+bp_{2n+1}(x) - p_{2n+1}(1-x) = 2c_{2n}x + b for all xx. p2n+1(0)−p2n+1(1−0)=0p_{2n+1}(0) - p_{2n+1}(1-0) = 0 and p2n+1(1)−p2n+1(1−1)=0p_{2n+1}(1) - p_{2n+1}(1-1) = 0 so 2c2n=0=b2c_{2n} = 0 = b. This proves that p2n+1(x)−p2n+1(1−x)=0p_{2n+1}(x) - p_{2n+1}(1-x) = 0 for all xx. In a similar way we shall prove the second equality: (p2n+2(x)+p2n+2(1−x))′=(2n+2)p2n+1′(x)+c2n+1−(2n+2)(p2n+1(1−x)+c2n+1)=0(p_{2n+2}(x) + p_{2n+2}(1-x))' = (2n+2)p_{2n+1}'(x) + c_{2n+1} - (2n+2)\left(p_{2n+1}(1-x) + c_{2n+1}\right) = 0 so the map x↦p2n+2(x)+p2n+2(1−x)x \mapsto p_{2n+2}(x) + p_{2n+2}(1-x) is constant hence p2n+2(x)+p2n+2(1−x)=p2n+2(0)+p2n+2(1−0)=0p_{2n+2}(x) + p_{2n+2}(1-x) = p_{2n+2}(0) + p_{2n+2}(1-0) = 0 for all xx. Now p2n+2′′(x)=((2n+2)p2n+1(x)+c2n+1)′=(2n+2)p2n+1′(x)=(2n+2)((2n+1)p2n(x)+c2n)=(2n+2)(2n+1)p2n(x)p_{2n+2}''(x) = ((2n+2)p_{2n+1}(x) + c_{2n+1})' = (2n+2)p_{2n+1}'(x) = (2n+2)((2n+1)p_{2n}(x) + c_{2n}) = (2n+2)(2n+1)p_{2n}(x). Since p2′(x)=2p1(x)+c1=x2−x+c1p_2'(x) = 2p_1(x) + c_1 = x^2 - x + c_1 we obtain p2′′(x)=2x−1<0p_2''(x) = 2x - 1 < 0 for x<12x < \frac{1}{2}.The function p2p_2 is strictly concave on [0,12][0, \frac{1}{2}] and p2(0)=0=p2(12)p_2(0) = 0 = p_2(\frac{1}{2}). Therefore p2(x)>0p_2(x) > 0 for x∈(0,12)x \in (0, \frac{1}{2}). This together with the equality p4(x)=12p2(x)p_4(x) = 12p_2(x) implies that p4p_4 is strictly convex on [0,12][0, \frac{1}{2}] so in view of p4(0)=0=p4(12)p_4(0) = 0 = p_4(\frac{1}{2}) we conclude that p4(x)<0p_4(x) < 0 for x∈(0,12)x \in (0, \frac{1}{2}). Easy induction shows that for x∈(0,12)x \in (0, \frac{1}{2}) one has p2n(x)>0p_{2n}(x) > 0 for an odd nn and p2n(x)<0p_{2n}(x) < 0 for an even nn. If t∈(0,12)t \in (0, \frac{1}{2}) then by (1) we get p100(1−t)−p100(t)=−2p100(t)>0p_{100}(1-t) - p_{100}(t) = -2p_{100}(t) > 0 as required.

Transcribed from the official solutions, page 5. This transcription has not been checked a second time; if in doubt, look at the original.

Archive problem: the statement is the official text (transcribed, with the original above). Subject classification and difficulty were estimated automatically; hints and a worked solution are added over time.

How did it go?