All-Russian Olympiad 2018
Grade 9
1
Suppose
is an infinite strictly increasing sequence of positive integers and
is a sequence of distinct primes such that
for all
. It turned out that
for all
. Prove that the sequence
consists only of prime numbers.







2
Circle
is tangent to sides
of triangle
. A circle
touches the side
and line
(produced beyond
), and touches
at a point
on side
. Line
meets
again at
. It turned out that
. Prove that
is isosceles.















3
Suppose that
are non-negative integers, and
is the smallest of them. Prove that
(As usual,
denotes the integer part of the number
, that is, the largest integer not exceeding
.)


![$$\big[\sqrt{a_1}\big]+\big[\sqrt{a_2}\big]+\cdots+\big[\sqrt{a_{25}}\big ]\geq\big[\sqrt{a_1+a_2+\cdots+a_{25}+200k}\big].$$](http://latex.artofproblemsolving.com/8/d/2/8d2fc0ec785a6d4acaa6f1c35129f5a22b3b9415.png)
![$[x]$](http://latex.artofproblemsolving.com/b/c/e/bceb7b14e55d33a8bca29b7863ad3cdae95afce4.png)


4
On the
checker board, several cells were marked in such a way that lower left (
) and upper right(
) cells are not marked and that for any knight-tour from
to
, there is at least one marked cell. For which
, is it possible that there always exists three consective cells going through diagonal for which at least two of them are marked?






5
On the circle, 99 points are marked, dividing this circle into 99 equal arcs. Petya and Vasya play the game, taking turns. Petya goes first; on his first move, he paints in red or blue any marked point. Then each player can paint on his own turn, in red or blue, any uncolored marked point adjacent to the already painted one. Vasya wins, if after painting all points there is an equilateral triangle, all three vertices of which are colored in the same color. Could Petya prevent him?
6





7
In a card game, each card is associated with a numerical value from 1 to 100, with each card beating less, with one exception: 1 beats 100. The player knows that 100 cards with different values lie in front of him. The dealer who knows the order of these cards can tell the player which card beats the other for any pair of cards he draws. Prove that the dealer can make one hundred such messages, so that after that the player can accurately determine the value of each card.
8















Grade 10
2
Let
be an acute-angled triangle with
. Let
and
be the midpoints of
and
, respectively; let
be an altitude in this triangle. A point
is chosen on the segment
so that
. The ray
meets the circumcircle
of
at
. Prove that
are concyclic.















3
A positive integer
is given. Initially,
cells are marked on an infinite checkered plane. We say that the cross of a cell
is the set of all cells lying in the same row or in the same column as
. By a turn, it is allowed to mark an unmarked cell
if the cross of
contains at least
marked cells. It appears that every cell can be marked in a sequence of such turns. Determine the smallest possible value of
.








4
Initially, a positive integer is written on the blackboard. Every second, one adds to the number on the board the product of all its nonzero digits, writes down the results on the board, and erases the previous number. Prove that there exists a positive integer which will be added inifinitely many times.
5
In a
table, positive numbers are written. It is known that, looking left-right, the numbers in each row form an arithmetic progression and, looking up-down, the numbers is each column form a geometric progression. Prove that all the ratios of the geometric progressions are equal.

6
Same as Grade 9 P6
7
Same as Grade 9 P8
8
The board used for playing a game consists of the left and right parts. In each part there are several fields and there’re several segments connecting two fields from different parts (all the fields are connected.) Initially, there is a violet counter on a field in the left part, and a purple counter on a field in the right part. Lyosha and Pasha alternatively play their turn, starting from Pasha, by moving their chip (Lyosha-violet, and Pasha-purple) over a segment to other field that has no chip. It’s prohibited to repeat a position twice, i.e. can’t move to position that already been occupied by some earlier turns in the game. A player losses if he can’t make a move. Is there a board and an initial positions of counters that Pasha has a winning strategy?
Grade 11
1
The polynomial
is such that the polynomials
and
are strictly monotone on the whole real axis. Prove that
is also strictly monotone on the whole real axis.




3
Same as Grade 10 P3
4
On the sides
and
of the triangle
, the points
and
are chosen, respectively, so that
. Segments
and
intersect at point
. Point
is symmetric to point
relative to line
. The segment
intersects the circumcircle
of the triangle
at the point
. Prove that circumcircle of
is tangent to the circle
.


















5
On the table, there're
cards arranged on a circle. On each card, a positive integer was written so that all
numbers are distinct. First, Vasya selects one of the card, remove it from the circle, and do the following operation: If on the last card taken out was written positive integer
, count the
clockwise card not removed, from that position, then remove it and repeat the operation. This continues until only one card left on the table. Is it possible that, initially, there's a card
such that, no matter what other card Vasya selects as first card, the one that left is always card
?






6
Three diagonals of a regular
-gon prism intersect at an interior point
. Show that
is the center of the prism.
(The diagonal of the prism is a segment joining two vertices not lying on the same face of the prism.)



(The diagonal of the prism is a segment joining two vertices not lying on the same face of the prism.)
7
Given a sequence of positive integers
defined by
. Show that there exists a positive integer
such that among any
consecutive terms in the sequence, there exists a term whose decimal representation contain digit
.





8
Initially, on the lower left and right corner of a
board, there're two horses, red and blue, respectively.
and
alternatively play their turn,
start first. Each turn consist of moving their horse (
-red, and
-blue) by, simultaneously,
cells respect to one coordinate, and
cells respect to the other; while preserving the rule that the horse can't occupied the cell that ever occupied by any horses in the game. The player who can't make the move loss, who has the winning strategy?







