olymmath

IMO 2005

International Mathematical Olympiad 2005.

Day 1

Problem 1

  • Day 1

Six points are chosen on the sides of an equilateral triangle ABCABC : A1A_1 , A2A_2 on BCBC , B1B_1 , B2B_2 on CACA and C1C_1 , C2C_2 on ABAB , such that they are the vertices of a convex hexagon A1A2B1B2C1C2A_1A_2B_1B_2C_1C_2 with equal side lengths.

Prove that the lines A1B2A_1B_2 , B1C2B_1C_2 and C1A2C_1A_2 are concurrent.

Bogdan Enescu, Romania

Answer, solutions and source

Problem 2

  • Day 1

Let a1,a2,…a_1,a_2,\ldots be a sequence of integers with infinitely many positive and negative terms. Suppose that for every positive integer nn the numbers a1,a2,…,ana_1,a_2,\ldots,a_n leave nn different remainders upon division by nn .

Prove that every integer occurs exactly once in the sequence a1,a2,…a_1,a_2,\ldots .

Answer, solutions and source

Problem 3

  • Day 1

Let x,y,zx,y,z be three positive reals such that xyz≥1xyz\geq 1 . Prove that x5−x2x5+y2+z2+y5−y2x2+y5+z2+z5−z2x2+y2+z5≥0.\frac { x^5-x^2 }{x^5+y^2+z^2} + \frac {y^5-y^2}{x^2+y^5+z^2} + \frac {z^5-z^2}{x^2+y^2+z^5} \geq 0 . Hojoo Lee, Korea

Answer, solutions and source

Day 2

Problem 4

  • Day 2
  • Answer

Determine all positive integers relatively prime to all the terms of the infinite sequence

an=2n+3n+6n−1,n≥1.a_{n} = 2^{n} + 3^{n} + 6^{n} - 1, n\geq 1.

Answer, solutions and source

Problem 5

  • Day 2

Let ABCDABCD be a fixed convex quadrilateral with BC=DABC=DA and BCBC not parallel with DADA . Let two variable points EE and FF lie of the sides BCBC and DADA , respectively and satisfy BE=DFBE=DF . The lines ACAC and BDBD meet at PP , the lines BDBD and EFEF meet at QQ , the lines EFEF and ACAC meet at RR .

Prove that the circumcircles of the triangles PQRPQR , as EE and FF vary, have a common point other than PP .

Answer, solutions and source

Problem 6

  • Day 2

In a mathematical competition, in which 66 problems were posed to the participants, every two of these problems were solved by more than 25\frac 25 of the contestants. Moreover, no contestant solved all the 66 problems. Show that there are at least 22 contestants who solved exactly 55 problems each.

Radu Gologan and Dan Schwartz

Answer, solutions and source