September 14, 2026 · Problem sheet · LibreTimes
IMO 2006
Day 1
Problem 1. Let be a triangle with incentre . A point in the interior of the triangle satisfies
Show that , and that equality holds if and only if .
Problem 2. Let be a regular 2006-gon. A diagonal of is called good if its endpoints divide the boundary of into two parts, each composed of an odd number of sides of . The sides of are also called good.
Suppose has been dissected into triangles by 2003 diagonals, no two of which have a common point in the interior of . Find the maximum number of isosceles triangles having two good sides that could appear in such a configuration.
Problem 3. Determine the least number such that the inequality
holds for all real numbers , and .
Day 2
Problem 4. Determine all pairs of integers such that
Problem 5. Let be a polynomial of degree with integer coefficients and let be a positive integer. Consider the polynomial , where occurs times. Prove that there are at most integers such that .
Problem 6. Assign to each side of a convex polygon the maximum area of a triangle that has as a side and is contained in . Show that the sum of the areas assigned to the sides of is at least twice the area of .
No comments yet
Be the first to share your thoughts.