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 7 of 8: Put every point on one degree-nn polynomial
F(x)=C−x−P(x),C=a+b,F(α)=0F(x)=C-x-P(x),\qquad C=a+b,\qquad F(\alpha)=0
Detailed analysis

Set C=a+bC=a+b. For every fixed point α\alpha of P2P^2, with β=P(α)\beta=P(\alpha), Step 6 gives α+β=C\alpha+\beta=C. Thus F(α)=C−α−P(α)=0F(\alpha)=C-\alpha-P(\alpha)=0. The two points a,ba,b also satisfy this equation, and FF has degree nn because PP does.