Documents

YearFilenameLanguageSource
2009IMO-2009-problems-eng.pdfen
Problem 1

Let nn be a positive integer and let a1,,aka_1, \ldots, a_k (k2k \geq 2) be distinct integers in the set {1,,n}\{1, \ldots, n\} such that nn divides ai(ai+11)a_i(a_{i+1} - 1) for i=1,,k1i = 1, \ldots, k-1. Prove that nn does not divide ak(a11)a_k(a_1 - 1).

Problem 2

Let ABCABC be a triangle with circumcentre OO. The points PP and QQ are interior points of the sides CACA and ABAB, respectively. Let KK, LL and MM be the midpoints of the segments BPBP, CQCQ and PQPQ, respectively, and let Γ\Gamma be the circle passing through KK, LL and MM. Suppose that the line PQPQ is tangent to the circle Γ\Gamma. Prove that OP=OQOP = OQ.

Problem 3

Suppose that s1,s2,s3,s_1, s_2, s_3, \ldots is a strictly increasing sequence of positive integers such that the subsequences

ss1,ss2,ss3,andss1+1,ss2+1,ss3+1,s_{s_1}, s_{s_2}, s_{s_3}, \ldots \quad \text{and} \quad s_{s_1 + 1}, s_{s_2 + 1}, s_{s_3 + 1}, \ldots

are both arithmetic progressions. Prove that the sequence s1,s2,s3,s_1, s_2, s_3, \ldots is itself an arithmetic progression.

Problem 4

Let ABCABC be a triangle with AB=ACAB = AC. The angle bisectors of CAB\angle CAB and ABC\angle ABC meet the sides BCBC and CACA at DD and EE, respectively. Let KK be the incentre of triangle ADCADC. Suppose that BEK=45\angle BEK = 45^{\circ}. Find all possible values of CAB\angle CAB.

Problem 5

Determine all functions ff from the set of positive integers to the set of positive integers such that, for all positive integers aa and bb, there exists a non-degenerate triangle with sides of lengths

a,f(b) and f(b+f(a)1).a, f(b) \text{ and } f(b + f(a) - 1).

(A triangle is non-degenerate if its vertices are not collinear.)

Problem 6

Let a1,a2,,ana_1, a_2, \ldots, a_n be distinct positive integers and let MM be a set of n1n - 1 positive integers not containing s=a1+a2++ans = a_1 + a_2 + \cdots + a_n. A grasshopper is to jump along the real axis, starting at the point 00 and making nn jumps to the right with lengths a1,a2,,ana_1, a_2, \ldots, a_n in some order. Prove that the order can be chosen in such a way that the grasshopper never lands on any point in MM.