Maths Olympiad Prep

Library / /30 of 63

, 2019

Algebra Difficulty 8.2 Shortlist Prove it Turkey

Let P(x)P(x) be a non-constant polynomial with real coefficients such that all of its roots are real numbers. Suppose that there exists a polynomial Q(x)Q(x) with real coefficients such that
(P(x))2=P(Q(x)) (P(x))^2 = P(Q(x))
for all real numbers xx. Prove that all roots of P(x)P(x) are equal.

Solution

Let P(x)=A(xr1)d1(xrk)dkP(x) = A(x - r_1)^{d_1} \cdots (x - r_k)^{d_k} where r1<<rkr_1 < \cdots < r_k. It is easy to see that Q(x)Q(x) has degree 22 and hence Q(x)=ax2+bx+cQ(x) = a x^2 + b x + c for some real numbers aa, bb and cc. Then the given equality can be written as
A2i=1k(xri)2di=Ai=1k(ax2+bx+cri)di. A^2 \prod_{i=1}^{k} (x - r_i)^{2d_i} = A \prod_{i=1}^{k} (a x^2 + b x + c - r_i)^{d_i}.
Therefore, for each ii the roots of ax2+bx+cria x^2 + b x + c - r_i are rsr_s and rtr_t for some ss and tt. On the other hand, the sum of the roots are b/a-b/a for every ii. Thus, all the roots of (P(x))2(P(x))^2 can be paired in a way that sum of the elements in each pair is the same. Let an r1r_1 be

paired with rsr_s and an rkr_k be paired with rtr_t. Since r1rtr_1 \le r_t, rsrkr_s \le r_k and r1+rs=rk+rtr_1 + r_s = r_k + r_t, we see that rs=rkr_s = r_k and rt=r1r_t = r_1. In other words, every r1r_1 has to be paired with an rkr_k and every rkr_k has to be matched with an r1r_1. Therefore, we obtain that d1=dkd_1 = d_k. By induction it is easy to prove that di=dk+1id_i = d_{k+1-i} for every ii and all pairs are of the form {rj,rk+1j}\{r_j, r_{k+1-j}\}.
Consequently, for every mm we have that (crm)/a(c - r_m)/a is equal to rjrk+1jr_j r_{k+1-j} for some jj. However, the numbers of the form rjrk+1jr_j r_{k+1-j} can attain at most k+12\lfloor \frac{k+1}{2} \rfloor distinct values and hence we get kk+12k \le \lfloor \frac{k+1}{2} \rfloor which implies k1k \le 1. Therefore, all the roots of P(x)P(x) are the same.

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.