olymmath

IMO 2006 Problem 5

  • Day 2

Let P(x)P(x) be a polynomial of degree n>1n > 1 with integer coefficients and let kk be a positive integer. Consider the polynomial Q(x)=P(P(…P(P(x))…))Q(x) = P(P(\ldots P(P(x)) \ldots )) , where PP occurs kk times. Prove that there are at most nn integers tt such that Q(t)=tQ(t) = t .

Official text Transcription from AI-MO AoPS, checked word for word against the official paper. Quoted with source.

Official text: IMO 2006 official English paper, page 2.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Locator imo/2006/p5 · Tag 9PWDAG0K5H · Edit this page on GitHub · Keys: j next, k previous