Olympiad Maths Prep

Track / Stage 6 / 12 of 400 #1012 of 2000

Problem 1012

National olympiad, first round
Algebra Difficulty 6.0 Prove it

5・107 Proof: For any polynomial P(x)≢xP(x) \not\equiv x and any nNn \in \mathbb{N}, the polynomial
Qn(x)=\overparenP(P(P(x)))x \left.\left.Q_{n}(x)=\overparen{P(P(\cdots P}(x) \cdots\right)\right)-x

is divisible by the polynomial Q1(x)=P(x)xQ_{1}(x)=P(x)-x.

This one wants a proof. Work it on paper, read the official solution, then mark yourself honestly — the ladder only means something if the record is true.

Official solution

[Proof] For nNn \in N using induction. Since the polynomial Q1(x)Q_{1}(x) divides itself, the conclusion holds when n=1n=1. Now assume that the identity Qn(x)=Rn(x)Q1(x)Q_{n}(x)=R_{n}(x) Q_{1}(x) has been proven for some nn, where Rn(x)R_{n}(x) is a polynomial, then we have
Qn+1(x)P[Qn(x)+x]xP[Rn(x)Q1(x)+x]x{P[Rn(x)Q1(x)+x}P(x)+[P(x)x] \begin{aligned} Q_{n+1}(x) & \equiv P\left[Q_{n}(x)+x\right]-x \\ & \equiv P\left[R_{n}(x) Q_{1}(x)+x\right]-x \\ & \equiv\left\{P\left[R_{n}(x) \cdot Q_{1}(x)+x\right\}-P(x)+[P(x)-x]\right. \end{aligned}

Assume

then
Qn+1(x)k=0mak((Rn(x)Q1(x)+x)kxk)+Q1(x)k=0makRn(x)Q1(x)Sk(x)+Q1(x)Q1(x)(1+k=0makRn(x)Sk(x)) \begin{aligned} Q_{n+1}(x) & \equiv \sum_{k=0}^{m} a_{k}\left(\left(R_{n}(x) Q_{1}(x)+x\right)^{k}-x^{k}\right)+Q_{1}(x) \\ & \equiv \sum_{k=0}^{m} a_{k} R_{n}(x) Q_{1}(x) S_{k}(x)+Q_{1}(x) \\ & \equiv Q_{1}(x)\left(1+\sum_{k=0}^{m} a_{k} R_{n}(x) S_{k}(x)\right) \end{aligned}

where
Sk(x)=j=0k1(Rn(x)Q1(x))jxkj1, S_{k}(x)=\sum_{j=0}^{k-1}\left(R_{n}(x) Q_{1}(x)\right)^{j} x^{k-j-1},

Here, we applied the identity
akbk=(ab)j=0k1ajbkj1, a^{k}-b^{k}=(a-b) \sum_{j=0}^{k-1} a^{j} b^{k-j-1},

and took a=Rn(x)Q1(x)+x,b=x\quad a=R_{n}(x) Q_{1}(x)+x, b=x.
This proves that the conclusion holds for n+1n+1.

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.