olymmath

IMO 2009

International Mathematical Olympiad 2009.

Day 1

Problem 1

  • Day 1

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

Answer, solutions and source

Problem 2

  • Day 1

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

Proposed by Sergei Berlov, Russia

Answer, solutions and source

Problem 3

  • Day 1

Suppose that s1,s2,s3,…s_1, s_2, s_3, \dots is a strictly increasing sequence of positive integers such that the subsequences ss1,ss2,ss3,…s_{s_1}, s_{s_2}, s_{s_3}, \dots and ss1+1,ss2+1,ss3+1,…s_{s_{1+1}}, s_{s_{2+1}}, s_{s_{3+1}}, \dots are both arithmetic progressions. Prove that the sequence s1,s2,s3,…s_1, s_2, s_3, \dots is itself an arithmetic progression.

Answer, solutions and source

Day 2

Problem 4

  • Day 2
  • Answer

Let △ABC\triangle ABC 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 incenter of triangle ADCADC. Suppose that ∠BEK=45∘\angle BEK = 45^\circ. Find all possible values of ∠CAB\angle CAB.

(This problem was suggested by Peter Vandendriessche and Jan Vonk from Belgium and by Hojoo Lee from South Korea.)

Answer, solutions and source

Problem 5

  • Day 2
  • Answer

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.)

Proposed by Bruno Le Floch, France

Answer, solutions and source

Problem 6

  • Day 2

Let a1,a2,…,ana_1, a_2, \ldots , a_n be distinct positive integers and let MM be a set of n−1n - 1 positive integers not containing s=a1+a2+…+an.s = a_1 + a_2 + \ldots + 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 M.M.

Proposed by Dmitry Khramtsov, Russia

Answer, solutions and source