Russian MAth Olimpiad2002

28-th All-Russian Mathematical Olympiad 2002
Final Round Maykop, April 2129

Grade 9
First Day April 23
1. Can the numbers from 1 to 20022 be written in the squares of a 2002 2002
board in such a way that, for each square, there exist three numbers in the union
(N.two.
Agakhanov)
of its row and its column, one of which is the product of the other
2. Point A lies on one ray and points B,C lie on the other ray of an angle with the
vertex at O such that B lies between O and C. Let O1 be the incenter of OAB
and O2 be the center of the excircle of OAC touching side AC. Prove that if
O1 A = O2 A, then the triangle ABC is isosceles.
(L. Emelyanov)
3. On a plane are given 6 red, 6 blue, and 6 green points, such that no three of the
given points lie on a line. Prove that the sum of the areas of the triangles whose
vertices are of the same color does not exceed quarter the sum of the areas of all
triangles with vertices in the given points.
(Y. Lifshits)
4. A hydra consists of several heads and several necks, where each neck joins two
heads. When a hydras head A is hit by a sword, all the necks from head A
disappear, but new necks grow up to connect head A to all the heads which
werent connected to A. Heracle defeats a hydra by cutting it into two parts
which are not joined. Find the minimum N for which Heracle can defeat any
hydra with 100 necks by no more than N hits.
(Y. Lifshits)
Second Day April 24
5. There are eight rooks on a chessboard, no two attacking each other. Prove that
some two of the pairwise distances between the rooks are equal. (The distance
(D. Kuznetsov)
between two rooks is the distance between the centers of their cells.)
6. We are given one red and k > 1 blue cells, and a pack of 2n cards numerated
by the numbers from 1 to 2n. Initially, the pack is situated on a red cell and
arranged in an arbitrary order. In each move, we are allowed to take the top card
from one of the cells and place it either onto the top of another cell on which the
number on the top card is greater by 1, or onto an empty cell. Given k, what is
the maximal n for which it is always possible to move all the cards onto a blue
(A. Belov)
cell?
The IMO Compendium Group,

D. Djukic, V. Jankovic, I. Matic, N. Petrovic
www.imomath.com
7. Let O be the circumcenter of a triangle ABC. Points M and N are chosen on the
sides AB and BC respectively so that 2MON = AOC. Prove that the perimeter
of triangle MBN is not less than the length of side AC.
(S. Berlov)
8. From the interval (22n , 23n ) are selected 22n1 + 1 odd numbers. Prove that there
are two among the selected numbers, none of which divides the square of the
other.
(S. Berlov)
Grade 10
First Day
1. The polynomials P, Q, R with real coefficients, one of which is of degree 2 and
two of degree 3, satisfy the equality P2 + Q2 = R2 . Prove that one of the polyno(A. Golovanov)
mials of degree 3 has three real roots.
2. A quadrilateral ABCD is inscribed in a circle . The tangent to at A intersects
the ray CB at K, and the tangent to at B intersects the ray DA at M. Prove that
(S. Berlov)
if AM = AD and BK = BC, then ABCD is a trapezoid.
3. Prove that for every integer n > 10000 there exists an integer
m such that it can
be written as the sum of two squares, and 0 < m n < 3 4 n.

(A. Golovanov)
4. There are 2002 towns in a kingdom. Some of the towns are connected by roads
in such a manner that, if all roads from one city close, one can still travel between
any two cities. Every year, the kind chooses a non-selfintersecting cycle of roads,
founds a new town, connects him by roads with each city from the chosen cycle,
and closes all the roads from the cycle as useless. After several years, no nonselfintersecting cycles remained. Prove that at that moment there are at least
(A. Pastor)
2002 towns, exactly one road going out from each of them.
Second Day
5. The sum of positive numbers a, b, c equals 3. Prove that
a + b + c ab + bc + ac.
(S. Zlobin)
6. Problem 6 for Grade 9.

7. Let A be the point of tangency of the excircle of a triangle ABC (corrsponding
to A) with the side BC. The line a through A is parallel to the bisector of BAC.
(L. Emelyanov)
Lines b and c are analogously defined. Prove that a, b, c have a common
point.

www.imomath.com
8. On a plane are given finitely many red and blue lines, no two parallel, such that
any intersection point of two lines of the same color also lies on another line of
Dolnikov,
the other color. Prove that all the lines pass through a (V.
single
point. I. Bogdanov)
Grade 11
First Day
2. Several points are given on the plane. Suppose that for any three of them there
exists an orthogonal coordinate system (determined by the two axes and the unit
length) in which these three points have integer coordinates. Prove that there
exists an orthogonal coordinate system in which all the given points have integer
(S. Berlov)
coordinates.
3. Prove that if 0 < x < /2 and n > m, where n, m are natural numbers,
2| sinn x cosn x| 3| sinm x cosm x|.
(V. Senderov)
4. There are several squares in a city. Some pairs of squares are joined by oneway streets so that exactly two streets go out of each square. Show that the city
can be divided into 1014 municipalities in such a manner that no two squares
in the same municipality are connected by a street, and all streets between two
(A. Pastor)
municipalities go in the same direction (from one to the other, or vice-versa).
Second Day
5. Determine the smallest natural number which can be represented both as the sum
of 2002 positive integers with the same sum of decimal digits, and as the sum of
2003 integers with the same sum of decimal digits.
(S. Tokarev)
6. The diagonals AC and BD of a cyclic quadrilateral ABCD meet in O. The circumcircles of triangles AOB and COD intersect again at K. Point L is such that
the triangles BLC and AKD are similar and equally oriented. Prove that if the
quadrlateral BLCK is convex, then it is tangent.
(S. Berlov)
8. Prove that there exist infinitely many natural numbers n such that the numerator
(F. Petrov)
of 1 + 12 + + n1 in the lowest terms is not a power of a prime number.

www.imomath.com

Russian MAth Olimpiad2002

Uploaded by

Copyright:

Available Formats

Russian MAth Olimpiad2002

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Russian MAth Olimpiad2002

Uploaded by

Copyright:

Available Formats

28-th All-Russian Mathematical Olympiad 2002

Final Round Maykop, April 2129

The IMO Compendium Group,

be written as the sum of two squares, and 0 < m n < 3 4 n.

6. Problem 6 for Grade 9.

The IMO Compendium Group,

The IMO Compendium Group,

You might also like