IMO Shortlist 1993

Algebra

1 Define a sequence < f (n) >∞

n=1 of positive integers by

f (1) = 1

and

f (n − 1) − n if f (n − 1) > n;
f (n) =
f (n − 1) + n if f (n − 1) ≤ n,
for n ≥ 2. Let S = {n ∈ N|f (n) = 1993}.
(i) Prove that S is an infinite set. (ii) Find the least positive integer in S. (iii) If all the
elements of S are written in ascending order as

n1 < n2 < n3 < . . . ,

show that
ni+1
lim = 3.
i→∞ ni

2 Show that there exists a finite set A ⊂ R2 such that for every X ∈ A there are points
Y1 , Y2 , . . . , Y1993 in A such that the distance between X and Yi is equal to 1, for every i.

3 Prove that
a b c d 2
+ + + ≥
b + 2c + 3d c + 2d + 3a d + 2a + 3b a + 2b + 3c 3
for all positive real numbers a, b, c, d.

4 Solve the following system of equations, in which a is a given number satisfying |a| > 1:
x21 = ax2 + 1
x22 = ax3 + 1
...
2
x999 = ax1000 + 1
x21000 = ax1 + 1

5 a > 0 and b, c are integers such that ac b2 is a square-free positive integer P. [hide=”For
example”] P could be 3*5, but not 32 ∗ 5.
Let f (n) be the number of pairs of integers d, e such that ad2 + 2bde + ce2 = n. Show thatf (n) is
finite and that f (n) = f (P k n) for every positive integer k.
Original Statement:

This file was downloaded from the AoPS Math Olympiad Resources Page Page 1
http://www.artofproblemsolving.com/
 IMO Shortlist 1993

Let a, b, c be given integers a > 0, ac − b2 = P = P1 · · · Pn where P1 · · · Pn are (distinct) prime

numbers. Let M (n) denote the number of pairs of integers (x, y) for which

ax2 + 2bxy + cy 2 = n.

Prove that M (n) is finite and M (n) = M (Pk · n) for every integer k ≥ 0. Note that the ”n” in PN
and the ”n” in M (n) do not have to be the same.

6 Let N = {1, 2, 3, . . .}. Determine if there exists a strictly increasing function f : N 7→ N with the
following properties:
(i) f (1) = 2;
(ii) f (f (n)) = f (n) + n, (n ∈ N).

7 Let n > 1 be an integer and let f (x) = xn + 5 · xn−1 + 3. Prove that there do not exist polynomials
g(x), h(x), each having integer coefficients and degree at least one, such that f (x) = g(x) · h(x).

8 Let c1 , . . . , cn ∈ R with n ≥ 2 such that

n
X
0≤ ci ≤ n.
i=1

Show that we can find integers k1 , . . . , kn such that

n
X
ki = 0
i=1

and
1 − n ≤ ci + n · ki ≤ n
for every i = 1, . . . , n.
[hide=”Another formulation:”] Let x1 , . . . , xn , with n ≥ 2 be real numbers such that

|x1 + . . . + xn | ≤ n.

Show that there exist integers k1 , . . . , kn such that

|k1 + . . . + kn | = 0.

and
|xi + 2 · n · ki | ≤ 2 · n − 1
1+xi
for every i = 1, . . . , n. In order to prove this, denote ci = 2 for i = 1, . . . , n, etc.

This file was downloaded from the AoPS Math Olympiad Resources Page Page 2
http://www.artofproblemsolving.com/
 IMO Shortlist 1993

9 Let a, b, c, d be four non-negative numbers satisfying

a + b + c + d = 1.

Prove the inequality

1 176
a·b·c+b·c·d+c·d·a+d·a·b≤ + · a · b · c · d.
27 27

This file was downloaded from the AoPS Math Olympiad Resources Page Page 3
http://www.artofproblemsolving.com/
 IMO Shortlist 1993

Combinatorics

1 a) Show that the set Q+ of all positive rationals can be partitioned into three disjoint subsets.
A, B, C satisfying the following conditions:

BA = B; B 2 = C; BC = A;

where HK stands for the set {hk : h ∈ H, k ∈ K} for any two subsets H, K of Q+ and H 2
stands for HH.
b) Show that all positive rational cubes are in A for such a partition of Q+ .
c) Find such a partition Q+ = A∪B ∪C with the property that for no positive integer n ≤ 34,
both n and n + 1 are in A, that is,

min{n ∈ N : n ∈ A, n + 1 ∈ A} > 34.

2 Let n, k ∈ Z+ with k ≤ n and let S be a set containing n distinct real numbers. Let T be a
set of all real numbers of the form x1 + x2 + . . . + xk where x1 , x2 , . . . , xk are distinct elements
of S. Prove that T contains at least k(n − k) + 1 distinct elements.

3 Let n > 1 be an integer. In a circular arrangement of n lamps L0 , . . . , Ln−1 , each of of which

can either ON or OFF, we start with the situation where all lamps are ON, and then carry
out a sequence of steps, Step0 , Step1 , . . . . If Lj−1 (j is taken mod n) is ON then Stepj changes
the state of Lj (it goes from ON to OFF or from OFF to ON) but does not change the state
of any of the other lamps. If Lj−1 is OFF then Stepj does not change anything at all. Show
that:
(i) There is a positive integer M (n) such that after M (n) steps all lamps are ON again,
(ii) If n has the form 2k then all the lamps are ON after n2 − 1 steps,
(iii) If n has the form 2k + 1 then all lamps are ON after n2 − n + 1 steps.

4 Let n ≥ 2, n ∈ N and A0 = (a01 , a02 , . . . , a0n ) be any n−tuple of natural numbers, such that
0 ≤ a0i ≤ i − 1, for i = 1, . . . , n. n−tuples A1 = (a11 , a12 , . . . , a1n ), A2 = (a21 , a22 , . . . , a2n ), . . .
are defined by: ai+1,j = Card{ai,l |1 ≤ l ≤ j − 1, ai,l ≥ ai,j }, for i ∈ N and j = 1, . . . , n. Prove
that there exists k ∈ N, such that Ak+2 = Ak .

5 Let Sn be the number of sequences (a1 , a2 , . . . , an ), where ai ∈ {0, 1}, in which no six consec-
utive blocks are equal. Prove that Sn → ∞ when n → ∞.

This file was downloaded from the AoPS Math Olympiad Resources Page Page 4
http://www.artofproblemsolving.com/
 IMO Shortlist 1993

Geometry

1 Let ABC be a triangle, and I its incenter. Consider a circle which lies inside the circumcircle
of triangle ABC and touches it, and which also touches the sides CA and BC of triangle
ABC at the points D and E, respectively. Show that the point I is the midpoint of the
segment DE.

2 A circle S bisects a circle S 0 if it cuts S 0 at opposite ends of a diameter. SA , SB ,SC are circles
with distinct centers A, B, C (respectively). Show that A, B, C are collinear iff there is no
unique circle S which bisects each of SA , SB ,SC . Show that if there is more than one circle
S which bisects each of SA , SB ,SC , then all such circles pass through two fixed points. Find
these points.
Original Statement:
A circle S is said to cut a circle Σ diametrically if and only if their common chord is
a diameter of Σ. Let SA , SB , SC be three circles with distinct centres A, B, C respectively.
Prove that A, B, C are collinear if and only if there is no unique circle S which cuts each of
SA , SB , SC diametrically. Prove further that if there exists more than one circle S which cuts
each SA , SB , SC diametrically, then all such circles S pass through two fixed points. Locate
these points in relation to the circles SA , SB , SC .

3 Let triangle ABC be such that its circumradius is R = 1. Let r be the inradius of ABC and
let p be the inradius of the orthic triangle A0 B 0 C 0 of triangle ABC. Prove that
1
p≤1− .
3 · (1 + r)2

[hide=”Similar Problem posted by Pascual2005”]

Let ABC be a triangle with circumradius R and inradius r. If p is the inradius of the orthic
2
(1+ Rr )
triangle of triangle ABC, show that Rp ≤ 1 − 3 .
Note. The orthic triangle of triangle ABC is defined as the triangle whose vertices are the
feet of the altitudes of triangle ABC.
SOLUTION 1 by mecrazywong:
p = 2R cos A cos B cos C, 1 + Rr = 1 + 4 sin A/2 sin B/2 sin C/2 = cos A + cos B + cos C. Thus,
the ineqaulity is equivalent to 6 cos A cos B cos C + (cos A + cos B + cos C)2 ≤ 3. But this is
easy since cos A + cos B + cos C ≤ 3/2, cos A cos B cos C ≤ 1/8.
SOLUTION 2 by Virgil Nicula:

This file was downloaded from the AoPS Math Olympiad Resources Page Page 5
http://www.artofproblemsolving.com/
 IMO Shortlist 1993

I note the inradius r0 of a orthic triangle.

r0 1 r 2


Must prove the inequality R ≤1− 3 1+ R .
From the wellknown relations r0 = 2R cos A cos B cos C
0
and cos A cos B cos C ≤ 18 results rR ≤ 14 .

2
2
But 41 ≤ 1 − 13 1 + Rr ⇐⇒ 13 1 + Rr ≤ 43 ⇐⇒

2
2
1 + Rr ≤ 32 ⇐⇒ 1 + Rr ≤ 32 ⇐⇒ Rr ≤ 21 ⇐⇒ 2r ≤ R (true).
0
2 0
2
Therefore, rR ≤ 14 ≤ 1 − 13 1 + Rr =⇒ rR ≤ 1 − 31 1 + Rr .
SOLUTION 3 by darij grinberg:
I know this is not quite an ML reference, but the problem was discussed in Hyacinthos
messages 6951, 6978, 6981, 6982, 6985, 6986 (particularly the last message).
4 Given a triangle ABC, let D and E be points on the side BC such that ∠BAD = ∠CAE. If
M and N are, respectively, the points of tangency of the incircles of the triangles ABD and
ACE with the line BC, then show that
1 1 1 1
+ = + .
MB MD NC NE

5 On an infinite chessboard, a solitaire game is played as follows: at the start, we have n2 pieces
occupying a square of side n. The only allowed move is to jump over an occupied square to
an unoccupied one, and the piece which has been jumped over is removed. For which n can
the game end with only one piece remaining on the board?
6 For three points A, B, C in the plane, we define m(ABC) to be the smallest length of the three
heights of the triangle ABC, where in the case A, B, C are collinear, we set m(ABC) = 0.
Let A, B, C be given points in the plane. Prove that for any point X in the plane,

m(ABC) ≤ m(ABX) + m(AXC) + m(XBC).

7 Let A, B, C, D be four points in the plane, with C and D on the same side of the line AB,
such that AC · BD = AD · BC and ∠ADB = 90◦ + ∠ACB. Find the ratio
AB · CD
,
AC · BD
and prove that the circumcircles of the triangles ACD and BCD are orthogonal. (Intersecting
circles are said to be orthogonal if at either common point their tangents are perpendicuar.
Thus, proving that the circumcircles of the triangles ACD and BCD are orthogonal is equiv-
alent to proving that the tangents to the circumcircles of the triangles ACD and BCD at
the point C are perpendicular.)

This file was downloaded from the AoPS Math Olympiad Resources Page Page 6
http://www.artofproblemsolving.com/
 IMO Shortlist 1993

8 The vertices D, E, F of an equilateral triangle lie on the sides BC, CA, AB respectively of a
triangle ABC. If a, b, c are the respective lengths of these sides, and S the area of ABC, prove
that
√
2· 2·S
DE ≥ p √ .
a2 + b2 + c2 + 4 · 3·S

This file was downloaded from the AoPS Math Olympiad Resources Page Page 7
http://www.artofproblemsolving.com/
 IMO Shortlist 1993

Number Theory

2 A natural number n is said to have the property P, if, for all a, n2 divides an − 1 whenever n
divides an − 1.
a.) Show that every prime number n has property P.
b.) Show that there are infinitely many composite numbers n that possess property P.

3 Let a, b, n be positive integers, b > 1 and bn − 1|a. Show that the representation of the number
a in the base b contains at least n digits different from zero.

4 Show that for any finite set S of distinct positive integers, we can find a set T S such that
every member of T divides the sum of all the members of T .
Original Statement:
A finite set of (distinct) positive integers is called a DS-set if each of the integers divides the
sum of them all. Prove that every finite set of positive integers is a subset of some DS-set.

5 Let S be the set of all pairs (m, n) of relatively prime positive integers m, n with n even and
m < n. For s = (m, n) ∈ S write n = 2k · no where k, n0 are positive integers with n0 odd
and define
f (s) = (n0 , m + n − n0 ).
Prove that f is a function from S to S and that for each s = (m, n) ∈ S, there exists a positive
integer t ≤ m+n+1
4 such that
f t (s) = s,
where
f t (s) = (f ◦ f ◦ · · · ◦ f )(s).
| {z }
t times

If m + n is a prime number which does not divide 2k − 1 for k = 1, 2, . .. , m + n − 2, prove

that the smallest value t which satisfies the above conditions is m+n+1
4 where [x] denotes
the greatest integer ≤ x.

This file was downloaded from the AoPS Math Olympiad Resources Page Page 8
http://www.artofproblemsolving.com/