olymmath

IMO 2006

International Mathematical Olympiad 2006.

Official paper

The official paper in 50 languages

English · Afrikaans · Albanian · Arabic · Armenian · Arabic (Moroccan) · Arabic (Kuwaiti) · Azerbaijani · Bosnian · Bulgarian · Chinese (Simplified) · Chinese (Traditional) · Czech · Danish · Dutch · Estonian · Finnish · French · Georgian · German · Hebrew · Croatian · Hungarian · Icelandic · Italian · Japanese · Korean · Latvian · Lithuanian · Macedonian · Malay · Mongolian · Norwegian · Persian (Farsi) · Polish · Portuguese · Romanian · Russian · Singhalese · Slovak · Slovenian · Spanish · Serbian (BIH) · Serbian · Swedish · Thai · Turkish · Ukrainian · Uzbek · Vietnamese

Day 1

Problem 2

Let PP be a regular 20062006 -gon. A diagonal 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 20032003 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.

Answer, solutions and source

Problem 3

Determine the least real number MM such that the inequality ∣ab(a2−b2)+bc(b2−c2)+ca(c2−a2)∣≤M(a2+b2+c2)2|ab(a^{2}-b^{2})+bc(b^{2}-c^{2})+ca(c^{2}-a^{2})| \leq M(a^{2}+b^{2}+c^{2})^{2} holds for all real numbers aa , bb and cc .

Answer, solutions and source

Day 2

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 .

Answer, solutions and source