olymmath

IMO 1989

International Mathematical Olympiad 1989.

Official paper

The official paper in 1 language

English

Day 1

Problem 1

  • Day 1

Prove that in the set {1,2,…,1989}\{1,2, \ldots, 1989\} can be expressed as the disjoint union of subsets Ai,{i=1,2,…,117}A_i, \{i = 1,2, \ldots, 117\} such that

i.) each AiA_i contains 17 elements

ii.) the sum of all the elements in each AiA_i is the same.

Answer, solutions and source

Problem 2

  • Day 1

ABCABC is a triangle, the bisector of angle AA meets the circumcircle of triangle ABCABC in A1A_1 , points B1B_1 and C1C_1 are defined similarly. Let AA1AA_1 meet the lines that bisect the two external angles at BB and CC in A0A_0 . Define B0B_0 and C0C_0 similarly. Prove that the area of triangle A0B0C0=2⋅A_0B_0C_0 = 2 \cdot area of hexagon AC1BA1CB1≥4⋅AC_1BA_1CB_1 \geq 4 \cdot area of triangle ABCABC .

Answer, solutions and source

Problem 3

  • Day 1

Let nn and kk be positive integers and let SS be a set of nn points in the plane such that

i.) no three points of SS are collinear, and

ii.) for every point PP of SS there are at least kk points of SS equidistant from P.P.

Prove that: k<12+2⋅nk < \frac {1}{2} + \sqrt {2 \cdot n}

Answer, solutions and source

Day 2

Problem 4

  • Day 2

Let ABCDABCD be a convex quadrilateral such that the sides AB,AD,BCAB, AD, BC satisfy AB=AD+BC.AB = AD + BC. There exists a point PP inside the quadrilateral at a distance hh from the line CDCD such that AP=h+ADAP = h + AD and BP=h+BC.BP = h + BC. Show that: 1h≥1AD+1BC\frac {1}{\sqrt {h}} \geq \frac {1}{\sqrt {AD}} + \frac {1}{\sqrt {BC}}

Answer, solutions and source

Problem 5

  • Day 2

Prove that for each positive integer nn there exist nn consecutive positive integers none of which is an integral power of a prime number.

Answer, solutions and source

Problem 6

  • Day 2

A permutation {x1,x2,…,x2n}\{x_1, x_2, \ldots, x_{2n}\} of the set {1,2,…,2n}\{1,2, \ldots, 2n\} where nn is a positive integer, is said to have property TT if ∣xi−xi+1∣=n|x_i - x_{i + 1}| = n for at least one ii in {1,2,…,2n−1}.\{1,2, \ldots, 2n - 1\}. Show that, for each nn , there are more permutations with property TT than without.

Answer, solutions and source