- Day 1
Let be a positive integer and let () be distinct integers in the set such that divides for . Prove that does not divide .
International Mathematical Olympiad 2009.
Let be a positive integer and let () be distinct integers in the set such that divides for . Prove that does not divide .
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
Proposed by Sergei Berlov, Russia
Suppose that is a strictly increasing sequence of positive integers such that the subsequences and are both arithmetic progressions. Prove that the sequence is itself an arithmetic progression.
Let be a triangle with . The angle bisectors of and meet the sides and at and , respectively. Let be the incenter of triangle . Suppose that . Find all possible values of .
(This problem was suggested by Peter Vandendriessche and Jan Vonk from Belgium and by Hojoo Lee from South Korea.)
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.)
Proposed by Bruno Le Floch, France
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
Proposed by Dmitry Khramtsov, Russia