September 14, 2026 · Problem sheet · LibreTimes
IMO 2009
Day 1
Wednesday, July 15, 2009.
Time: 4 hours and 30 minutes. Each problem is worth 7 points.
Problem 1. Let be a positive integer and let () be distinct integers in the set such that divides for . Prove that does not divide .
Problem 2. Let be a triangle with circumcentre . The points and are interior points of the sides and , respectively. Let , and be the midpoints of the segments , and , respectively, and let be the circle passing through , and . Suppose that the line is tangent to the circle . Prove that .
Problem 3. Suppose that is a strictly increasing sequence of positive integers such that the subsequences
are both arithmetic progressions. Prove that the sequence is itself an arithmetic progression.
Day 2
Thursday, July 16, 2009.
Time: 4 hours and 30 minutes. Each problem is worth 7 points.
Problem 4. Let be a triangle with . The angle bisectors of and meet the sides and at and , respectively. Let be the incentre of triangle . Suppose that . Find all possible values of .
Problem 5. Determine all functions from the set of positive integers to the set of positive integers such that, for all positive integers and , there exists a non-degenerate triangle with sides of lengths
(A triangle is non-degenerate if its vertices are not collinear.)
Problem 6. Let be distinct positive integers and let be a set of positive integers not containing . A grasshopper is to jump along the real axis, starting at the point and making jumps to the right with lengths in some order. Prove that the order can be chosen in such a way that the grasshopper never lands on any point in .
No comments yet
Be the first to share your thoughts.