Maths Olympiad Prep

Library / /2 of 7

Algebra Difficulty 6.5 National olympiad Prove it Vietnam

For each polynomial P(x)P(x), define
P1(x)=P(x),xR, P_1(x) = P(x), \forall x \in \mathbb{R},
P2(x)=P(P1(x)),xR, P_2(x) = P(P_1(x)), \forall x \in \mathbb{R},
P2024(x)=P(P2023(x)),xR. P_{2024}(x) = P(P_{2023}(x)), \forall x \in \mathbb{R}.
Let a>2a > 2 be a real number. Is there a polynomial PP with real coefficients such that for all t(a,a)t \in (-a, a), the equation P2024(x)=tP_{2024}(x) = t has 220242^{2024} distinct real roots?

Solution

We will present two solutions for this problem.

First solution:
We will prove that the polynomial P(x)=2ax2aP(x) = \frac{2}{a}x^2 - a satisfies the requirements of the problem. Specifically, we will prove the equation
P2024(x)=t() P_{2024}(x) = t \quad (*)
there are exactly 220242^{2024} distinct solutions in the interval (a,a)(-a, a). Indeed, let x=acosφx = a \cos \varphi (0<φ<π0 < \varphi < \pi). Then
P1(acosφ)=P(acosφ)=a(2cos2φ1)=acos2φ, P_1(a \cos \varphi) = P(a \cos \varphi) = a(2 \cos^2 \varphi - 1) = a \cos 2\varphi,
P2(acosφ)=P(acos2φ)=acos22φ, P_2(a \cos \varphi) = P(a \cos 2\varphi) = a \cos 2^2\varphi,
P2024(acosφ)=acos22024φ. P_{2024}(a \cos \varphi) = a \cos 2^{2024}\varphi.
The equation (*) becomes acos22024φ=ta \cos 2^{2024}\varphi = t. This equation is equivalent to
22024φ=±arccosta+2kπ, 2^{2024}\varphi = \pm \arccos \frac{t}{a} + 2k\pi,
so
φ=±arccosta+2kπ22024(kZ). \varphi = \frac{\pm \arccos \frac{t}{a} + 2k\pi}{2^{2024}} \quad (k \in \mathbb{Z}).
Since 0<φ<π0 < \varphi < \pi, the equation (*) has exactly 220242^{2024} distinct real roots as
x=acosarccosta+2kπ22024,k{0,1,,220231} x = a \cos \frac{\arccos \frac{t}{a} + 2k\pi}{2^{2024}}, \quad k \in \{0, 1, \dots, 2^{2023} - 1\}
and
x=acosarccosta+2kπ22024,k{1,2,,22023}. x = a \cos \frac{-\arccos \frac{t}{a} + 2k\pi}{2^{2024}}, \quad k \in \{1, 2, \dots, 2^{2023}\}.
So, P(x)=2ax2aP(x) = \frac{2}{a}x^2 - a is a polynomial that satisfies the problem requirements. ■

Second solution:
Consider the polynomial P(x)=x2cP(x) = x^2 - c with cc being some constant in the range (a,a2a)(a, a^2 - a). We will prove that, for all positive integers nn and for every real number t(a,a)t \in (-a, a), the equation Pn(x)=tP_n(x) = t has exactly 220242^{2024} distinct real roots in the interval (a,a)(-a, a).

With n=1n = 1, the equation P1(x)=tP_1(x) = t has two distinct real solutions: c+t-\sqrt{c+t} and c+t\sqrt{c+t}. Both of these solutions belong to the range (a,a)(-a, a). Thus, the assertion is true for n=1n = 1.

Assuming the assertion is true up to n=kn = k, that means the equation Pk(x)=tP_k(x) = t has exactly 2k2^k distinct solutions in the segment (a,a)(-a, a) namely x1,x2,,x2kx_1, x_2, \dots, x_{2^k}. Consider the equation Pk+1(x)=tP_{k+1}(x) = t. This equation is equivalent to
Pk(P(x))=t, P_k(P(x)) = t,
or
P(x){x1,x2,,x2k}.() P(x) \in \{x_1, x_2, \dots, x_{2^k}\}. \quad (*)
According to the results of the case n=1n = 1, each equation P(x)=xiP(x) = x_i has exactly two distinct real roots in the interval (a,a)(-a, a).

In addition, because xixjx_i \neq x_j for all iji \neq j so the solutions of the equation P(x)=xiP(x) = x_i are distinct from the solutions of the equation P(x)=xjP(x) = x_j. Combined with (*), we deduce that the equation Pk+1(x)=tP_{k+1}(x) = t has exactly 2k+12^{k+1} distinct real roots in the range (a,a)(-a, a). Thus the conclusion is also true for n=k+1n = k + 1. According to the principle of induction, we have the assertion true for all positive integers nn. In particular, the equation P2024(x)=tP_{2024}(x) = t has exactly 220242^{2024} distinct real roots. \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 and solution reproduced as published; topic and difficulty added by this site.