25-th All-Russian Mathematical Olympiad 1999

Final Round

Grade 9

First Day

1. The decimal digits of a natural number A form an increasing sequence (from left
to right). Find the sum of digits of 9A. (S. Volchenkov)

2. There are several cities in a country. Some pairs of the cities are connected by a
two-way airline of one of the N companies, so that each company serves exactly
one airline from each city, and one can travel between any two cities, possibly
with transfers. During a financial crisis, N − 1 airlines have been canceled, all
from different companies. Prove that it is still possible to travel between any two
cities. (D. Karpov)

3. A triangle ABC is inscribed in a circle S. Let A0 and C0 be the midpoints of the

arcs BC and AB os S, not containing the opposite vertex, respectively. The circle
S1 centered at A0 is tangent to BC, and the circle S2 centered at C0 is tangent to
AB. Prove that the incenter I of △ABC lies on a common tangent to (M. Sonkin)
S1 and S2 .

4. The numbers from 1 to 1000000 are painted black and white. In each step,
one may choose one of these numbers and change the color of every number
(including itself) that is not coprime to the chosen one. Initially, all the numbers
are black. Is it possible to obtain a situation in which all the numbers are white
in finitely many steps? (S. Berlov)

Second Day

5. An equilateral triangle of side n is divided into equilateral triangles of side 1.

Find the greatest possible number of unit segments with endpoints at vertices
of the small triangles that can be chosen so that no three of them are sides of a
single triangle. (M. Antonov)

6. Prove that for all natural numbers n,

n2 n√ o n2 − 1
∑ k ≤
2
.
k=1

({x} denotes the fractional part of x.) (A. Hrabrov)

7. A circle through vertices A and B of a triangle ABC meets side BC again at D. A

circle through B and C meets side AB at E and the first circle again at F. Prove
(S. Berlov)
that if points A, E, D,C lie on a circle with center O, then ∠BFO is right.

The IMO Compendium Group,

D. Djukić, V. Janković, I. Matić, N. Petrović
www.imomath.com
8. There are 2000 components in a circuit, every two of which were initially joined
by a wire. The hooligans Vasya and Petya cut the wires one after another. Vasya,
who starts, cuts one wire on his turn, while Petya cuts one or three. The hooligan
who cuts the last wire from some component, loses. Who of them has a winning
strategy? (D. Karpov)

Grade 10

First Day

1. There are three empty jugs on a table. Winnie the Pooh, Rabbit and Piglet put
walnuts in the jugs one by one. They play successively, with the initial deter-
mined by a draw. Thereby Winnie the Pooh plays either in the first or second
jug, Rabbit in the second or third, and Piglet in the first or third. The player after
whose move there are exactly 1999 walnuts, loses the game. Show that Winnie
the Pooh and Piglet can cooperate so as to make Rabbit lose. (F. Bakharev)

2. Find all bounded sequences (an )∞

n=1 of natural numbers such that for all n ≥ 3,

an−1 + an−2
an = .
gcd(an−1 , an−2 )
(S. Volchenkov)

3. The incircle of a triangle ABC is tangent to AB, BC, AC at K, L, M, respectively.

The external common tangents to the incircles of triangles BKL,CLM and AKM,
distinct from the sides of △ABC, are drawn. Prove that these three tangents have
a common point. (M. Sonkin)

4. On an infinite chessboard, n2 markers are placed on the cells of an n × n square

(one marker on each cell). A legal move is a jump over a neighboring occu-
pied square to an unoccupied one, and the piece which has been jumped over
is removed (two squares are neighboring if they share a side). Prove that, no
matter how one plays, at least [n2 /3] legal moves will be made before arriving to
a situation in which no more moves will be possible. (S. Tokarev)

Second Day

5. The sum of (decimal) digits of a natural number n equals 100, and the sum of
digits of 44n equals 800. Determine the sum of digits of 3n.
(A. Golovanov)

6. In a triangle ABC, a circle through A and B is tangent to line BC, and a circle
through B and C is tangent to line AB and intersects the first circle at point K 6= B.
If O is the circumcenter of △ABC, prove that ∠BKO is right. (S. Berlov)

The IMO Compendium Group,

D. Djukić, V. Janković, I. Matić, N. Petrović
www.imomath.com
7. Positive numbers x, y satisfy x2 + y3 ≥ x3 + y4. Prove that x3 + y3 ≤ 2.
(S. Zlobin)

8. In a group of 12 persons, among any 9 there are 5 which know each other. Prove
that there are 6 persons in this group which know each other.
(V. Dolnikov)

Grade 11

First Day

1. Do there exist 19 distinct natural numbers with equal sums of digits, whose sum
equals 1999? (O. Podlipskiy)

2. Each rational point on a real line is assigned an integer. Prove that there is a
segment such that the sum of the numbers at its endpoints does not exceed twice
the number at its midpoint. (S. Berlov)

3. A circle touches sides DA, AB, BC,CD of a quadrilateral ABCD at points

K, L, M, N, respectively. Let S1 , S2 , S3 , S4 respectively be the incircles of trian-
gles AKL, BLM,CMN, DNK. The external common tangents distinct from the
sides of ABCD are drawn to S1 and S2 , S2 and S3 , S3 and S4 , S4 and S1 . Prove
that these four tangents determine a rhombus.
(M. Sonkin)

4. Problem 4 for Grade 10.

Second Day

5. Four natural numbers are such that the square of the sum of any two of them is
divisible by the product of the other two numbers. Prove that at least three of
these numbers are equal. (S. Berlov)

6. Three convex polygons are given on a plane. Prove that there is no line cutting
all the polygons if and only if each of the polygons can be separated from the
other two by a line. (V. Dolnikov)

7. A plane through the vertex A of a tetrahedron ABCD is tangent to its circum-

sphere. Prove that the intersection lines of this plane with the planes ABC, ACD
and ABD form six equal angles if and only if AB ·CD = AC · BD =(D. · BC.
ADTeryoshin)

8. There are 2000 components in a circuit, every two of which were initially joined
by a wire. The hooligans Vasya and Petya cut the wires one after another. Vasya,
who starts, cuts one wire on his turn, while Petya cuts two or three. The hooligan
who cuts the last wire from some component, loses. Who of them has a winning
strategy? (D. Karpov)

The IMO Compendium Group,

D. Djukić, V. Janković, I. Matić, N. Petrović
www.imomath.com