MathLabs

Problem 5

Let P(x)P(x) be a polynomial of degree n>1n>1 with integer coefficients, and let kk be a positive integer. Define Q(x)=P(P(…P(x)…))Q(x)=P(P(\ldots P(x)\ldots)), where PP occurs kk times. Prove that there are at most nn integers tt such that Q(t)=tQ(t)=t.
Step 2 of 8: Follow the orbit of a fixed point of QQ
xi+1=P(xi),xk=x0x_{i+1}=P(x_i),\qquad x_k=x_0
Detailed analysis

Let Q(x0)=x0Q(x_0)=x_0 and define xi+1=P(xi)x_{i+1}=P(x_i). Then xk=x0x_k=x_0. If every such integer x0x_0 also satisfies P(x0)=x0P(x_0)=x_0, the roots of P(x)−xP(x)-x already give the desired bound because this polynomial has degree nn.