AoPS Community 2004 IMO Shortlist

IMO Shortlist 2004

www.artofproblemsolving.com/community/c3955
by Valentin Vornicu, darij grinberg, Sasha, Pascual2005, Chang Woo-JIn, silouan, orl, pohoatza, grob-
ber, vinoth 90 2004, Tales, ZetaX, pigfly, pbornsztein, Zorro, Peter Scholze, matematikator, jmerry, K09,
pleurestique, Severius

– Geometry

1 1. Let ABC be an acute-angled triangle with AB 6= AC. The circle with diameter BC intersects
the sides AB and AC at M and N respectively. Denote by O the midpoint of the side BC. The
bisectors of the angles ∠BAC and ∠M ON intersect at R. Prove that the circumcircles of the
triangles BM R and CN R have a common point lying on the side BC.

2 Let Γ be a circle and let d be a line such that Γ and d have no common points. Further, let AB
be a diameter of the circle Γ; assume that this diameter AB is perpendicular to the line d, and
the point B is nearer to the line d than the point A. Let C be an arbitrary point on the circle
Γ, different from the points A and B. Let D be the point of intersection of the lines AC and
d. One of the two tangents from the point D to the circle Γ touches this circle Γ at a point E;
hereby, we assume that the points B and E lie in the same halfplane with respect to the line
AC. Denote by F the point of intersection of the lines BE and d. Let the line AF intersect the
circle Γ at a point G, different from A.

Prove that the reflection of the point G in the line AB lies on the line CF .

3 Let O be the circumcenter of an acute-angled triangle ABC with ∠B < ∠C. The line AO meets
the side BC at D. The circumcenters of the triangles ABD and ACD are E and F , respectively.
Extend the sides BA and CA beyond A, and choose on the respective extensions points G and
H such that AG = AC and AH = AB. Prove that the quadrilateral EF GH is a rectangle if and
only if ∠ACB − ∠ABC = 60◦ .
Proposed by Hojoo Lee, Korea

4 In a convex quadrilateral ABCD, the diagonal BD bisects neither the angle ABC nor the angle
CDA. The point P lies inside ABCD and satisfies
∠P BC = ∠DBA and ∠P DC = ∠BDA.
Prove that ABCD is a cyclic quadrilateral if and only if AP = CP .

5 Let A1 A2 A3 . . . An be a regular n-gon. Let B1 and Bn−1 be the midpoints of its sides A1 A2 and
An−1 An . Also, for every i ∈ {2, 3, 4, . . . , n − 2}. Let S be the point of intersection of the lines
A1 Ai+1 and An Ai , and let Bi be the point of intersection of the angle bisector bisector of the
angle ]Ai SAi+1 with the segment Ai Ai+1 .

© 2019 AoPS Incorporated 1

AoPS Community 2004 IMO Shortlist
Pn−1
Prove that i=1 ]A1 Bi An = 180◦ .
Proposed by Dusan Dukic, Serbia and Montenegro

6 Let P be a convex polygon. Prove that there exists a convex hexagon that is contained in P
and whose area is at least 34 of the area of the polygon P .
Alternative version. Let P be a convex polygon with n ≥ 6 vertices. Prove that there exists a
convex hexagon with
a) vertices on the sides of the polygon (or)
b) vertices among the vertices of the polygon
such that the area of the hexagon is at least 3
4 of the area of the polygon.
Proposed by Ben Green and Edward Crane, United Kingdom

7 For a given triangle ABC, let X be a variable point on the line BC such that C lies between B
and X and the incircles of the triangles ABX and ACX intersect at two distinct points P and
Q. Prove that the line P Q passes through a point independent of X.

8 Given a cyclic quadrilateral ABCD, let M be the midpoint of the side CD, and let N be a point
on the circumcircle of triangle ABM . Assume that the point N is different from the point M
and satisfies BN
AN AM
= BM . Prove that the points E, F , N are collinear, where E = AC ∩ BD and
F = BC ∩ DA.
Proposed by Dusan Dukic, Serbia and Montenegro

– Number Theory

1 Let τ (n) denote the number of positive divisors of the positive integer n. Prove that there exist
infinitely many positive integers a such that the equation τ (an) = n does not have a positive
integer solution n.

2 The function f from the set N of positive integers into itself is defined by the equality
n
X
f (n) = gcd(k, n), n ∈ N.
k=1

a) Prove that f (mn) = f (m)f (n) for every two relatively prime m, n ∈ N.
b) Prove that for each a ∈ N the equation f (x) = ax has a solution.
c) Find all a ∈ N such that the equation f (x) = ax has a unique solution.

© 2019 AoPS Incorporated 2

AoPS Community 2004 IMO Shortlist

3 Find all functions f : N∗ → N∗ satisfying

2
f 2 (m) + f (n) | m2 + n

for any two positive integers m and n.

Remark. The abbreviation N∗ stands for the set of all positive integers: N∗ = {1, 2, 3, ...}.
By f 2 (m), we mean (f (m))2 (and not f (f (m))).
Proposed by Mohsen Jamali, Iran

4 Let k be a fixed integer greater than 1, and let m = 4k 2 − 5. Show that there exist positive
integers a and b such that the sequence (xn ) defined by

x0 = a, x1 = b, xn+2 = xn+1 + xn for n = 0, 1, 2, . . . ,

has all of its terms relatively prime to m.

Proposed by Jaroslaw Wroblewski, Poland

5 We call a positive integer alternating if every two consecutive digits in its decimal representa-
tion are of different parity.

Find all positive integers n such that n has a multiple which is alternating.

6 Given an integer n > 1, denote by Pn the product of all positive integers x less than n and such
that n divides x2 − 1. For each n > 1, find the remainder of Pn on division by n.
Proposed by John Murray, Ireland

7 Let p be an odd prime and n a positive integer. In the coordinate plane, eight distinct points
with integer coordinates lie on a circle with diameter of length pn . Prove that there exists a
triangle with vertices at three of the given points such that the squares of its side lengths are
integers divisible by pn+1 .
Proposed by Alexander Ivanov, Bulgaria

– Algebra

1 Let n ≥ 3 be an integer. Let t1 , t2 , ..., tn be positive real numbers such that

 
1 1 1
n2 + 1 > (t1 + t2 + · · · + tn ) + + ··· + .
t1 t2 tn

Show that ti , tj , tk are side lengths of a triangle for all i, j, k with 1 ≤ i < j < k ≤ n.

© 2019 AoPS Incorporated 3

AoPS Community 2004 IMO Shortlist

2 Let a0 , a1 , a2 , ... be an infinite sequence of real numbers satisfying the equation an = |an+1 − an+2 |
for all n ≥ 0, where a0 and a1 are two different positive reals.
Can this sequence a0 , a1 , a2 , ... be bounded?
Proposed by Mihai Blun, Romania

3 Does there exist a function s : Q → {−1, 1} such that if x and y are distinct rational numbers
satisfying xy = 1 or x + y ∈ {0, 1}, then s(x)s(y) = −1? Justify your answer.
Proposed by Dan Brown, Canada

4 Find all polynomials f with real coefficients such that for all reals a, b, c such that ab+bc+ca = 0
we have the following relations

f (a − b) + f (b − c) + f (c − a) = 2f (a + b + c).

5 If a, b ,c are three positive real numbers such that ab + bc + ca = 1, prove that

r r r
3 1 3 1 3 1 1
+ 6b + + 6c + + 6a ≤ .
a b c abc

6 Find all functions f : R → R satisfying the equation

f (x2 + y 2 + 2f (xy)) = (f (x + y))2 .

for all x, y ∈ R.

7 Let a1 , a2 , . . . , an be positive real numbers, n > 1. Denote by gn their geometric mean, and by
A1 , A2 , . . . , An the sequence of arithmetic means defined by
a1 + a2 + · · · + ak
Ak = , k = 1, 2, . . . , n.
k
Let Gn be the geometric mean of A1 , A2 , . . . , An . Prove the inequality
r
Gn gn
nn + ≤n+1
An Gn
and establish the cases of equality.
Proposed by Finbarr Holland, Ireland

– Combinatorics

© 2019 AoPS Incorporated 4

AoPS Community 2004 IMO Shortlist

1 There are 10001 students at an university. Some students join together to form several clubs
(a student may belong to different clubs). Some clubs join together to form several societies
(a club may belong to different societies). There are a total of k societies. Suppose that the
following conditions hold:
i.) Each pair of students are in exactly one club.
ii.) For each student and each society, the student is in exactly one club of the society.
iii.) Each club has an odd number of students. In addition, a club with 2m + 1 students (m is a
positive integer) is
in exactly m societies.
Find all possible values of k.
Proposed by Guihua Gong, Puerto Rico

2 Let n and k be positive integers. There are given n circles in the plane. Every two of them inter-
sect at two distinct points, and all points of intersection they determine are pairwise distinct
(i. e. no three circles have a common point). No three circles have a point in common. Each
intersection point must be colored with one of n distinct colors so that each color is used at
least once and exactly k distinct colors occur on each circle. Find all values of n ≥ 2 and k for
which such a coloring is possible.
Proposed by Horst Sewerin, Germany

3 The following operation is allowed on a finite graph: Choose an arbitrary cycle of length 4 (if
there is any), choose an arbitrary edge in that cycle, and delete it from the graph. For a fixed
integer n ≥ 4, find the least number of edges of a graph that can be obtained by repeated ap-
plications of this operation from the complete graph on n vertices (where each pair of vertices
are joined by an edge).
Proposed by Norman Do, Australia

4 Consider a matrix of size n×n whose entries are real numbers of absolute value not exceeding
1. The sum of all entries of the matrix is 0. Let n be an even positive integer. Determine the least
number C such that every such matrix necessarily has a row or a column with the sum of its
entries not exceeding C in absolute value.
Proposed by Marcin Kuczma, Poland

5 A and B play a game, given an integer N , A writes down 1 first, then every player sees the last
number written and if it is n then in his turn he writes n + 1 or 2n, but his number cannot be
bigger than N . The player who writes N wins. For which values of N does B win?
Proposed by A. Slinko & S. Marshall, New Zealand

© 2019 AoPS Incorporated 5

AoPS Community 2004 IMO Shortlist

6 For an n × n matrix A, let Xi be the set of entries in row i, and Yj the set of entries in column
j, 1 ≤ i, j ≤ n. We say that A is golden if X1 , . . . , Xn , Y1 , . . . , Yn are distinct sets. Find the least
integer n such that there exists a 2004 × 2004 golden matrix with entries in the set {1, 2, . . . , n}.

7 Define a ”hook” to be a figure made up of six unit squares as shown below in the picture, or
any of the figures obtained by applying rotations and reflections to this figure.

Determine all m × n rectangles that can be covered without gaps and without overlaps with
hooks such that
- the rectangle is covered without gaps and without overlaps
- no part of a hook covers area outside the rectangle.

8 For a finite graph G, let f (G) be the number of triangles and g(G) the number of tetrahedra
formed by edges of G. Find the least constant c such that

g(G)3 ≤ c · f (G)4

for every graph G.

Proposed by Marcin Kuczma, Poland

© 2019 AoPS Incorporated 6

Art of Problem Solving is an ACS WASC Accredited School.