#CompetitionYearsProblemsYears
1International Mathematical Olympiad1959–2025398
2Middle European Mathematical Olympiad2009–2025160
International Mathematical Olympiad 2006 Problem 2

Let PP be a regular 2006-gon. A diagonal of PP is called good if its endpoints divide the boundary of PP into two parts, each composed of an odd number of sides of PP. The sides of PP are also called good.

Suppose PP has been dissected into triangles by 2003 diagonals, no two of which have a common point in the interior of PP. Find the maximum number of isosceles triangles having two good sides that could appear in such a configuration.

International Mathematical Olympiad 2006 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. 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.