Kazakhstan Olympiads 2021

Authors: Satylkhanov Kanat, Kungozhin Medeubek

Contents
Problems 3
XVII International Zhautykov Olympiad 2021 . . . . . . 4
XX Silk Road Mathematics Competition 2021 . . . . . 5
Kazakhstan National Olympiad 2021. Grade 9 . . . . . 6
Kazakhstan National Olympiad 2021. Grade 10 . . . . . 7
Kazakhstan National Olympiad 2021. Grade 11 . . . . . 8

Solutions 9
XVII International Zhautykov Olympiad 2021 . . . . . . 10
XX Silk Road Mathematics Competition 2021 . . . . . 23
Ðåñïóáëèêàíñêàÿ îëèìïèàäà 2021 ãîäà. 9 êëàññ . . . . 28
Ðåñïóáëèêàíñêàÿ îëèìïèàäà 2021 ãîäà. 10 êëàññ . . . 33
Ðåñïóáëèêàíñêàÿ îëèìïèàäà 2021 ãîäà. 11 êëàññ . . . 39
Problems
4 Problems. XVII International Zhautykov Olympiad 2021

XVII International Zhautykov Olympiad 2021

№1. Prove that for some positive integer 𝑛 the remainder of 3𝑛 when divided
by 2𝑛 is greater than 102021 .
№2. In a convex cyclic hexagon 𝐴𝐵𝐶𝐷𝐸𝐹 𝐵𝐶 = 𝐸𝐹 and 𝐶𝐷 = 𝐴𝐹 .
Diagonals 𝐴𝐶 and 𝐵𝐹 intersect at point 𝑄, and diagonals 𝐸𝐶 and 𝐷𝐹 intersect
at point 𝑃 . Points 𝑅 and 𝑆 are marked on the segments 𝐷𝐹 and 𝐵𝐹 respectively
so that 𝐹 𝑅 = 𝑃 𝐷 and 𝐵𝑄 = 𝐹 𝑆 . The segments 𝑅𝑄 and 𝑃 𝑆 intersect at point
𝑇 . Prove that the line 𝑇 𝐶 bisects the diagonal 𝐷𝐵 .
№3. Let 𝑛 ≥ 2 be an integer. Elwyn is given an 𝑛 × 𝑛 table lled with real
numbers (each cell of the table contains exactly one number). We dene a rook
set as a set of 𝑛 cells of the table situated in 𝑛 distinct rows as well as in 𝑛
distinct columns. Assume that, for every rook set, the sum of 𝑛 numbers in the
cells forming the set is nonnegative.
By a move, Elwyn chooses a row, a column, and a real number 𝑎, and then
he adds 𝑎 to each number in the chosen row, and subtracts 𝑎 from each number
in the chosen column (thus, the number at the intersection of the chosen row
and column does not change). Prove that Elwyn can perform a sequence of
moves so that all numbers in the table become nonnegative.
№4. A circle with radius 𝑟 is inscribed in the triangle 𝐴𝐵𝐶 . Circles with radii
𝑟1 , 𝑟2 , 𝑟3 (𝑟1 , 𝑟2 , 𝑟3 < 𝑟) are inscribed in the angles 𝐴, 𝐵, 𝐶 so that each touches
the incircle externally. Prove that 𝑟1 + 𝑟2 + 𝑟3 ≥ 𝑟.
№5. On a party with 99 guests, hosts Ann and Bob play a game (the hosts are
not regarded as guests). There are 99 chairs arranged in a circle; initially, all
guests hang around those chairs. The hosts take turns alternately. By a turn,
a host orders any standing guest to sit on an unoccupied chair 𝑐. If some chair
adjacent to 𝑐 is already occupied, the same host orders one guest on such chair
to stand up (if both chairs adjacent to 𝑐 are occupied, the host chooses exactly
one of them). All orders are carried out immediately. Ann makes the rst move;
her goal is to fulll, after some move of hers, that at least 𝑘 chairs are occupied.
Determine the largest 𝑘 for which Ann can reach the goal, regardless of Bob's
play.
№6. Let 𝑃 (𝑥) be a nonconstant polynomial of degree 𝑛 with rational coecients
which can not be presented as a product of two nonconstant polynomials with
rational coecients. Prove that the number of polynomials 𝑄(𝑥) of degree less
than 𝑛 with rational coecients such that 𝑃 (𝑥) divides 𝑃 (𝑄(𝑥))
a) is nite;
b) does not exceed 𝑛.
Problems. XX “Silk Road” Mathematics Competition 2021 5

XX “Silk Road” Mathematics Competition 2021

№1. A sequence 𝑠 consisting of zeroes and ones is given. For each positive
integer 𝑘 we dene 𝑣𝑘 as the maximum number of ways to nd consecutive digits
forming the sequence 𝑠 in a sequence of 𝑘 digits. (For example, if 𝑠 = 0110, then
𝑣7 = 𝑣8 = 2, since in the sequences 0110110 and 01101100 consecutive digits
0110 are found in two places, and three pairs of ones surrounded by zeroes can
not occur in a sequence of 7 or 8 digits.) It is known that 𝑣𝑛 < 𝑣𝑛+1 < 𝑣𝑛+2 for
some positive integer 𝑛. Prove that all the digits in the sequence 𝑠 are identical.
√
№2. For every positive integer 𝑚 prove the inequality |{ 𝑚} − 21 | > 8(√𝑚+1) 1
.
№3. Let 𝑀 be the midpoint of side 𝐴𝐵 in triangle 𝐴𝐵𝐶 . 𝐵1 is a point on
segment 𝐴𝐶 such that 𝐶𝐵 = 𝐶𝐵1 . The circumcircles of triangles 𝐴𝐵𝐶 and
𝐵𝑀 𝐵1 , 𝜔 and 𝜔1 , intersect for the second time at point 𝐾 . Let 𝑄 be the
midpoint of arc 𝐴𝐶𝐵 of 𝜔 . Lines 𝐵1 𝑄 and 𝐵𝐶 intersect at point 𝐸 . Prove that
line 𝐾𝐶 passes through the midpoint of segment 𝐵1 𝐸 .
№4. Integers 𝑥, 𝑦 , 𝑧 , 𝑡 satisfy 𝑥2 + 𝑦 2 = 𝑧 2 + 𝑡2 and 𝑥𝑦 = 2𝑧𝑡. Prove that
𝑥𝑦𝑧𝑡 = 0.
6 Problems. Kazakhstan National Olympiad 2021. Grade 9

Kazakhstan National Olympiad 2021. Grade 9

№1. Let 𝑎, 𝑏, 𝑐 be positive real numbers such that

1 19
𝑎+𝑏+𝑐+ = .
𝑎𝑏𝑐 2
Find the largest possible value of 𝑎.
№2. Hundred encyclopedia books, numbered with distinct integers from 1 to
100, are arranged in some order in the row. The operation consists of taking
arbitrary three books and rearranging them in any order between themselves
(i.e., the positions of the other 97 books remain unchanged). The books are in
the correct order if the 𝑖th book is in the 𝑖th place. Find the smallest 𝑚 such
that regardless of the initial books' order, it is possible to perform 𝑚 operations
after which the books are in the correct order.
№3. Given convex quadrilateral 𝐴𝐵𝐶𝐷 . The extensions of the sides 𝐴𝐵 and
𝐶𝐷 meet at the point 𝑃 , and the diagonals 𝐴𝐶 and 𝐵𝐷 meet at the point
𝑄. The points 𝑀 and 𝑁 are the midpoint of 𝐴𝐶 and 𝐵𝐷, respectively. The
circumcircles of triangles 𝐵𝐶𝑄 and 𝑀 𝑁 𝑄 intersect at the point 𝑇 (𝑇 ̸= 𝑄).
Prove that if ∠𝐴𝑃 𝐷 = 90∘ , then the line 𝑃 𝑇 bisects 𝑀 𝑁 .
№4. The triangle 𝐴𝐵𝐶 (𝐴𝐶 > 𝐵𝐶 ) is inscribed in the circle 𝜔 . The bisector
𝐶𝑁 of this triangle meets 𝜔 at the point 𝑀 (𝑀 ̸= 𝐶 ). An arbitrary point 𝑇
is marked on the line segment 𝐵𝑁 . Let 𝐻 be the orthocenter of the triangle
𝑀 𝑁 𝑇 . The circumcircle of triangle 𝑀 𝑁 𝐻 meets 𝜔 at the point 𝑅 (𝑅 ̸= 𝑀 ).
Prove that ∠𝐴𝐶𝑇 = ∠𝐵𝐶𝑅.
№5. Are there pairwise distinct positive integer numbers 𝑎1 , 𝑎2 , . . . , 𝑎100 that
satisfy the both conditions:
i ) the number 𝑎1 𝑎2 . . . 𝑎100 is divisible by 𝑎𝑖 + 𝑎𝑗 for all 1 ≤ 𝑖 < 𝑗 ≤ 100;
ii ) for each 𝑘 = 1, 2, . . . , 100, there are indices 𝑖, 𝑗 such that 1 ≤ 𝑖 < 𝑗 ≤ 100
and the number 𝑎1 𝑎2 . . . 𝑎𝑘−1 𝑎𝑘+1 . . . 𝑎100 is not divisible by 𝑎𝑖 + 𝑎𝑗 ?
№6. A positive integer 𝑛 is given. A sequence (𝑥1 , 𝑥2 , . . . , 𝑥𝑛 ) of real numbers
is called , if
good

𝑥31 + 𝑥32 + . . . + 𝑥3𝑖 = (𝑥1 + 𝑥2 + . . . + 𝑥𝑖 )2 .

for each 𝑖 = 1, 2, . . . , 𝑛. Prove that the number of distinct good sequences

does not exceed 3𝑛−1 + 2𝑛−1 . (Sequences (𝑥1 , 𝑥2 , . . . , 𝑥𝑛 ) and (𝑦1 , 𝑦2 , . . . , 𝑦𝑛 )
are considered dierent, if 𝑥𝑖 ̸= 𝑦𝑖 for at least one 𝑖 = 1, 2, . . . , 𝑛.)
Problems. Kazakhstan National Olympiad 2021. Grade 10 7

Kazakhstan National Olympiad 2021. Grade 10

№1. Is it possible to cut a 100 × 100 chessboard square into an equal number
of 2 × 4 and 1 × 8 rectangles? (Figures can be rotated and ipped.)
№2. Given a triangle 𝐴𝐵𝐶 , in which 𝐴𝐵 + 𝐴𝐶 > 3𝐵𝐶 . The points 𝑃 and
𝑄 lies in inside of this triangle such that ∠𝐴𝐵𝑃 = ∠𝑃 𝐵𝑄 = ∠𝑄𝐵𝐶 and
∠𝐴𝐶𝑄 = ∠𝑄𝐶𝑃 = ∠𝑃 𝐶𝐵 . Show that 𝐴𝑃 + 𝐴𝑄 > 2𝐵𝐶 .
№3. The sequences (𝑎𝑛 ) and (𝑏𝑛√) are specied by the conditions 𝑎1 = 𝑏1 = 1,
√
𝑎𝑛+1 = 𝑎𝑛 + 𝑎𝑛 , 𝑏𝑛+1 = 𝑏𝑛 + 𝑏𝑛 for all positive integers 𝑛. Prove that the
3

exist a positive integer 𝑛 for which the inequality 𝑎𝑛 ≤ 𝑏𝑘 < 𝑎𝑛+1 holds for
exactly 2021 values of 𝑘 .
№4. On the side 𝐴𝐶 of triangle 𝐴𝐵𝐶 , there is a point 𝐷 such that 𝐵𝐶 = 𝐷𝐶 .
Let 𝐽 be the incenter of triangle 𝐴𝐵𝐷. Prove that one of the tangents from
point 𝐽 to the incircle of the triangle 𝐴𝐵𝐶 is parallel to line 𝐵𝐷.
№5. Find all functions 𝑓 : 𝑅+ → 𝑅+ such that
2
𝑓 (𝑥) = 𝑓 (𝑥𝑦) + 𝑓 (𝑥 + 𝑓 (𝑦)) − 1

for all 𝑥, 𝑦 ∈ 𝑅+ . (Here 𝑅+ is the set of positive real numbers.)

№6. Let 𝑎 be a positive integer number. Prove that for any integer solution
(𝑥, 𝑦) of the equation

𝑥(𝑦 2 − 2𝑥2 ) + 𝑥 + 𝑦 + 𝑎 = 0
√
the following inequality holds: |𝑥| ≤ 𝑎 + 2𝑎2 + 2.
8 Problems. Kazakhstan National Olympiad 2021. Grade 11

Kazakhstan National Olympiad 2021. Grade 11

№1. Hundred encyclopedia books, numbered with distinct integers from 1 to

100, are arranged in some order in the row. The operation consists of taking
arbitrary three books and rearranging them in any order between themselves
(i.e., the positions of the other 97 books remain unchanged). The books are in
the correct order if the 𝑖th book is in the 𝑖th place. Find the smallest 𝑚 such
that regardless of the initial books' order, it is possible to perform 𝑚 operations
after which the books are in the correct order.
№2. Prove that there are innitely many pairs (𝑎, 𝑏) of positive integers such
that 𝑎 ̸= 𝑏 and for any positive integer 𝑛 the following equality holds
[︁√ √︀ ]︁ [︁√︀ ]︁
𝑎2 𝑛 + 𝑏2 𝑛 + 1 = (𝑎 + 𝑏)2 𝑛 + 3 .

(Here [𝑥] is the integer part numbers 𝑥, i.e greatest integer number which does
not exceed 𝑥.)
№3. Let 𝑀 be the interior point of triangle 𝐴𝐵𝐶 such that

max(∠𝑀 𝐴𝐵, ∠𝑀 𝐵𝐶, ∠𝑀 𝐶𝐴) = ∠𝑀 𝐶𝐴.

Prove that sin ∠𝑀 𝐴𝐵 + sin ∠𝑀 𝐵𝐶 ≤ 1.

№4. An acute-angled triangle 𝐴𝐵𝐶 is inscribed in a circle Ω. The heights
𝐴𝐷, 𝐵𝐸 and 𝐶𝐹 are drawn in this triangle. Line 𝐴𝐷 intersect Ω a second
time at point 𝑃 . Lines 𝑃 𝐹 and 𝑃 𝐸 intersect Ω a second time at points 𝑅 and
𝑄, respectively. Let 𝑂1 and 𝑂2 be the circumcenters of triangles 𝐵𝐹 𝑅 and
𝐶𝐸𝑄, respectively. Prove that the line 𝑂1 𝑂2 passes through the midpoint of
the segment 𝐸𝐹 .
№5. Let 𝑎 be a positive integer number. Prove that for any integer solution
(𝑥, 𝑦) of the equation

𝑥(𝑦 2 − 2𝑥2 ) + 𝑥 + 𝑦 + 𝑎 = 0
√
the following inequality holds: |𝑥| ≤ 𝑎 + 2𝑎2 + 2.
№6. Given polynomial 𝑃 (𝑥) with real coecients and a positive integer 𝑛. For
any positive integer 𝑚 there exists an integer 𝑙 such that 𝑃 (𝑙) = 𝑚𝑛 . Prove that
𝑘
there exist real numbers 𝑎, 𝑏 and a positive integer 𝑘 such that 𝑃 (𝑥) = (𝑎𝑥 + 𝑏)
for all real 𝑥.
Solutions
10 Solutions. XVII International Zhautykov Olympiad 2021

XVII International Zhautykov Olympiad 2021

№1. Prove that for some positive integer 𝑛 the remainder of 3𝑛 when divided
by 2𝑛 is greater than 102021 . (Golovanov A.)
Solution I. We choose a positive integer 𝑀 such that 2𝑀 > 102022 , and
consider the remainder of 3𝑀 when divided by 2𝑀 :

3𝑀 ≡ 𝑟 (mod 2𝑀 ), 0 < 𝑟 < 2𝑀 .

If 𝑟 > 102021 , then 𝑀 is the desired number. Otherwise we choose the smallest
integer 𝑘 for which 3𝑘 𝑟 > 102021 . Then 3𝑘 𝑟 < 102022 < 2𝑀 . Since 3𝑘+𝑀 ≡
3𝑘 𝑟 (mod 2𝑀 ), the remainder of 3𝑘+𝑀 when divided by 2𝑘+𝑀 has the form
3𝑘 𝑟 + 2𝑀 𝑠 with some positive integer 𝑠, and is therefore greater than 102021 .
Solution II. We choose a positive integer 𝑘 such that 2𝑘+2 > 102021 . We
𝑘
are going to determine 𝑣2 (32 − 1), i. e. the largest 𝑚 such that 2𝑚 divides
𝑘
32 − 1. According to well-known lifting the exponent lemma,
𝑘
𝑣2 (32 − 1) = 𝑣2 (32 − 1) + 𝑘 − 1 = 𝑘 + 2.

Then the number 𝑛 = 2𝑘 satises the condition, Indeed, if 𝑟 is the remainder

𝑘 𝑘 𝑘
when 3𝑛 is divided by 2𝑛 , then 𝑟 ≡ 32 (mod 22 ) and therefore 𝑟 ≡ 32
(mod 2𝑘+3 ) (we use the fact that 2𝑘 ≥ 𝑘 + 3). Since 2𝑘+2 divides 𝑟 − 1 and
2𝑘+3 does not, 𝑟 ≡ 1 + 2𝑘+2 (mod 2𝑘+3 ), thus 𝑟 ≥ 1 + 2𝑘+2 > 102021 .
Solution III. Choose a positive integer 𝑘 such that 3𝑘 > 102021 , and a
positive integer 𝑚 such that 2𝑚 > 3𝑘 . There exists a positive integer 𝑇 such
that 3𝑇 ≡ 1 (mod 2𝑚 ) (we may take, for instance, 𝑇 = 2𝑚−2 ). Then for all
positive integral 𝑠
3𝑘+𝑠𝑇 ≡ 3𝑘 (mod 2𝑚 ),
that is, 3𝑘+𝑠𝑇 leaves the remainder 3𝑘 after division by 2𝑚 and, therefore, a
remainder not less than 3𝑘 > 102021 after division by any higher power of 2.
Now we can take 𝑛 = 𝑘 + 𝑠𝑇 such that 𝑘 + 𝑠𝑇 > 𝑚.
№2. In a convex cyclic hexagon 𝐴𝐵𝐶𝐷𝐸𝐹 𝐵𝐶 = 𝐸𝐹 and 𝐶𝐷 = 𝐴𝐹 .
Diagonals 𝐴𝐶 and 𝐵𝐹 intersect at point 𝑄, and diagonals 𝐸𝐶 and 𝐷𝐹 intersect
at point 𝑃 . Points 𝑅 and 𝑆 are marked on the segments 𝐷𝐹 and 𝐵𝐹 respectively
so that 𝐹 𝑅 = 𝑃 𝐷 and 𝐵𝑄 = 𝐹 𝑆 . The segments 𝑅𝑄 and 𝑃 𝑆 intersect at
point 𝑇 . Prove that the line 𝑇 𝐶 bisects the diagonal 𝐷𝐵 . (Kungozhin M.)
First solution. It follows obviously that 𝐵𝐹 ‖ 𝐶𝐸 and 𝐴𝐶 ‖ 𝐷𝐹 . We
denote the circumcircles of △𝐴𝐵𝑄 and △𝐷𝐸𝑃 by 𝜔1 and 𝜔2 , respectively.
Note that the lines 𝐴𝐷 and 𝐵𝐸 are internal common tangents to 𝜔1 and 𝜔2 .
Indeed, ∠𝐵𝐴𝑄 = ∠𝐵𝐸𝐶 = ∠𝐸𝐵𝑄, i. e., 𝐸𝐵 is tangent to 𝜔1 ; the other
tangencies are established similarly. Note that 𝐶𝑃 𝐹 𝑄 is a parallelogram. Then
Solutions. XVII International Zhautykov Olympiad 2021 11

𝐶𝑄 = 𝐹 𝑃 = 𝑅𝐷, that is, 𝐶𝑄𝑅𝐷 is also a parallelogram as well as 𝐶𝑃 𝑆𝐵 .

The lines 𝐵𝐶 and 𝐷𝐶 are not parallel to 𝐵𝐷. Therefore 𝑅𝑄 and 𝑃 𝑆 intersect
the line 𝐵𝐷; we denote the intersections by 𝑋 and 𝑌 respectively. It follows
that 𝑋 lies on 𝜔1 , since ∠𝑄𝐴𝐵 = ∠𝐶𝐷𝐵 = ∠𝐵𝑋𝑄. Similarly, 𝑌 lies on 𝜔2 .
Thus
𝐷𝐵 · 𝐷𝑋 = 𝐷𝐴2 = 𝐵𝐸 2 = 𝐵𝐷 · 𝐵𝑌,
hence 𝐷𝑋 = 𝐵𝑌 , or 𝐵𝑋 = 𝐷𝑌 . Let 𝑇 𝐶 and 𝐵𝐷 meet at 𝑍 . Then it follows
from 𝑇 𝑋 ‖ 𝐶𝐷 and 𝑇 𝑌 ‖ 𝐵𝐶 that

𝐷𝑍 𝐶𝑍 𝐵𝑍
= = ,
𝐷𝑋 𝐶𝑇 𝐵𝑌
which immediately gives 𝐷𝑍 = 𝐵𝑍 .
YY

E
E D
D
R
R
P
P
F
F TT

Z C
C
S
S Z
Q
Q

A
A B
B

X
X
Note. The equality 𝐵𝑋 = 𝐷𝑌 can be also proved by applying Menelaus
theorem to △𝐵𝐷𝐹 and the lines 𝑅 − 𝑄 − 𝑋 and 𝑆 − 𝑃 − 𝑌 .
Second solution. We follow the rst solution, using 𝐵𝐹 ‖ 𝐶𝐸 and 𝐴𝐶 ‖
𝐷𝐹 to note that 𝐶𝑃 𝐹 𝑄, 𝐶𝑄𝑅𝐷, and 𝐶𝑃 𝑆𝐵 are parallelograms.
Let 𝑁 and 𝑀 be points on the segments 𝐶𝑄 and 𝑅𝑁 respectively such
that 𝐹 𝑅𝑁 𝑄 and 𝐹 𝑅𝑀 𝑆 are parallelograms. Then 𝑆𝑀 = 𝐹 𝑅 = 𝑃 𝐷 and
𝑆𝑀 ‖ 𝑃 𝐷, that is, 𝑆𝑀 𝐷𝑃 is also a parallelogram, hence 𝐷𝑀 = 𝑃 𝑆 = 𝐶𝐵
and 𝐷𝑀 ‖ 𝐶𝐵 , therefore 𝐷𝑀 𝐵𝐶 is a parallelogram, and 𝐶𝑀 bisects 𝐵𝐷. It
remains to prove that 𝑇 , 𝑀 , 𝐶 are collinear.
12 Solutions. XVII International Zhautykov Olympiad 2021

Applying Menelaus theorem to △𝐹 𝑅𝑄 and the line 𝑃 − 𝑇 − 𝑆 (and bearing

in mind the parallelograms found above) we have

𝐹 𝑃 𝑅𝑇 𝑄𝑆 𝑄𝐶 𝑅𝑇 𝑁 𝑀
1= · · = · · ,
𝑃 𝑅 𝑇 𝑄 𝑆𝐹 𝐶𝑁 𝑇 𝑄 𝑀 𝑅

that is,
𝑄𝐶 𝑅𝑇 𝑁 𝑀
· · = 1. (1)
𝐶𝑁 𝑇 𝑄 𝑀 𝑅
The collinearity 𝑇 , 𝑀 , 𝐶 follows from (1) immediately by converse Menelaus
theorem for △𝑄𝑁 𝑅.

E
E D
D
P
P
R
R
F
F TT
M
M C
C
S
S
Q
Q N
N

A
A B
B

№3. Let 𝑛 ≥ 2 be an integer. Elwyn is given an 𝑛 × 𝑛 table lled with real

numbers (each cell of the table contains exactly one number). We dene a rook
set as a set of 𝑛 cells of the table situated in 𝑛 distinct rows as well as in 𝑛
distinct columns. Assume that, for every rook set, the sum of 𝑛 numbers in the
cells forming the set is nonnegative.
By a move, Elwyn chooses a row, a column, and a real number 𝑎, and then
he adds 𝑎 to each number in the chosen row, and subtracts 𝑎 from each number
in the chosen column (thus, the number at the intersection of the chosen row
and column does not change). Prove that Elwyn can perform a sequence of
moves so that all numbers in the table become nonnegative. (Bogdanov I.)

Common remarks. We collect here several denitions and easy observations

which will be used in the solutions.
A rook set is nonnegative (resp., vanishing ) if the sum of the numbers in
its cells is nonnegative (resp., zero). An 𝑛 × 𝑛 table lled with real numbers is
good (resp., balanced ) if every rook set is nonnegative (resp., vanishing).
Solutions. XVII International Zhautykov Olympiad 2021 13

Notice that the sum of numbers in any rook set does not change during
Elwyn's moves, so good (balanced) tables remain such after any sequence of
moves. Also, notice that the rows and/or columns of the table can be permuted
with no eect on the condition of the problem, as well as on the desired result.
The proofs of the following two easy propositions can be found in the
addendum after Solution 2.
Proposition 1. Assume that 𝑎1 , 𝑎2 , . . . , 𝑎𝑛 and 𝑏1 , 𝑏2 , . . . , 𝑏𝑛 are two sequences
of real numbers with equal sums. Then Elwyn can perform a sequence of moves
resulting in adding 𝑎𝑖 to all cells in the 𝑖th row, and subtracting 𝑏𝑗 from all
numbers in the 𝑗 th column, for all 𝑖, 𝑗 = 1, 2, . . . , 𝑛.
Proposition 2. If an 𝑛×𝑛 table 𝐵 is balanced, then Elwyn can perform several
moves on that table getting a table lled with zeros.

Solution 1. We start with the following known consequence of Hall's lemma.

Lemma. Let 𝐺 = (𝑈 ⊔ 𝑉, 𝐸) be a bipartite multigraph with parts 𝑈 and 𝑉 ,
both of size 𝑛. Assume that each vertex has degree 𝑘 ; then the edges can be
partitioned into 𝑘 perfect matchings.
Proof. Induction on 𝑘 ; the base case 𝑘 = 1 is trivial. To perform the step, it
suces to nd one perfect matching in the graph: removing the edges of that
matching, we obtain a graph with all degrees equal to 𝑘 − 1.
The existence of such matching is guaranteed by Hall's lemma. Indeed, let
𝑈 ′ be any subset of 𝑈 , and let 𝑉 ′ be the set of vertices adjacent to 𝑈 ′ . Put
𝑢 = |𝑈 ′ | and 𝑣 = |𝑉 ′ |. The total degree of vertices in 𝑈 ′ is 𝑘𝑢. so the total
degree of vertices in 𝑉 ′ is at least 𝑘𝑢; hence 𝑘𝑢 ≤ 𝑘𝑣 and therefore 𝑢 ≤ 𝑣 ,
which establishes the conditions of Hall's lemma.
The following claim is the principal step in this solution.
Claim. In any good table, one can decrease some numbers so that the table
becomes balanced.
Proof. Say that a cell in a good table is blocked if it is contained in a vanishing
rook set (so, decreasing the number in the cell would break goodness of the
table). First, we show that in any good table one can decrease several numbers
so that the table remains good, and all its cells become blocked.
Consider any cell 𝑐; let 𝜖 be the minimal sum in a rook set containing that
cell. Decrease the number in 𝑐 by 𝜖; the obtained table is still good, but now
𝑐 is blocked. Apply such operation to all cells in the table consecutively; we
arrive at a good table all whose cells are blocked. We claim that, in fact, this
table is balanced.
In the sequel, we use the following correspondence. Let 𝑅 and 𝐶 be the sets
of rows and columns of the table, respectively. Then each cell corresponds to
14 Solutions. XVII International Zhautykov Olympiad 2021

a pair of the row and the column it is situated in; this pair may be regarded
as an edge of a bipartite (multi)graph with parts 𝑅 and 𝐶 . This way, any rook
set corresponds to a perfect matching between those parts.
Arguing indirectly, assume that there is a non-vanishing rook set

𝑆 = {𝑠1 , 𝑠2 , . . . , 𝑠𝑛 }.

Each cell 𝑠𝑖 is contained in some vanishing rook set 𝑉𝑖 . Now construct a bipartite
multigraph 𝐺 = (𝑅 ⊔ 𝐶, 𝐸), introducing, for each set 𝑉𝑖 , 𝑛 edges corresponding
to its cells (thus, 𝐺 contains 𝑛2 edges some of which may be parallel). Mark
each edge with the number in the corresponding cell. Since the sets 𝑉𝑖 are all
vanishing, the sum of all 𝑛2 marks is zero.
Now, remove 𝑛 edges corresponding to the cells of 𝑆 , to obtain a graph 𝐺′ .
Since the sum of numbers in the cells of 𝑆 is positive, the sum of the marks
in 𝐺′ is negative. On the other hand, the degree of every vertex in 𝐺′ is 𝑛 − 1,
so by the Lemma its edges can be partitioned into 𝑛 − 1 perfect matchings.
At least one of the obtained matchings has negative sum of marks; so this
matching corresponds to a rook set with a negative sum. This is impossible in
a good table; this contradiction nishes the proof.
Back to the problem, let 𝑇 be Elwyn's table. Applying the Claim, decrease
some numbers in it to get a balanced table 𝐵 . By Proposition 2, Elwyn can
perform some moves on table 𝐵 so as to get a table lled with zeros. Applying
the same moves to 𝑇 , Elwyn gets a table where all numbers are nonnegative,
as required.

Solution 2. Say that the badness of a table is the sum of absolute values of
all its negative entries. In Step 1, we will show that, whenever the badness of
a good table is nonzero, Elwyn can make some moves decreasing the badness.
In a (technical) Step 2, we will show that this claim yields the required result.
Step 1. Let 𝑟 be a row containing some negative number. Mark all cells in
row 𝑟 containing negative numbers, and mark all cells in other rows containing
nonpositive numbers. Then there is no rook set consisting of marked cells, since
that set would not be nonnegative.
By K onig's theorem (which is equivalent to Hall's lemma), for some 𝑎 and
𝑏 with 𝑎 + 𝑏 < 𝑛, one can choose 𝑎 rows and 𝑏 columns such that their union
contains all marked cells; x such a choice. Number the rows from top to
bottom, and the columns from left to right. We distinguish two cases.
Case 1: Row 𝑟 is among the 𝑎 chosen rows.
Permute the rows and columns so that the top 𝑎 rows and the right 𝑏
columns are chosen. Next, if row 𝑟 contains a negative number in some of the 𝑎
Solutions. XVII International Zhautykov Olympiad 2021 15

leftmost entries, swap the column containing that entry with the (𝑛 − 𝑏)th one
(recall that 𝑛 − 𝑏 > 𝑎). As a result, there exists 𝑥 > 𝑎 such that the 𝑥th left
entry in row 𝑟 is negative (while the chosen columns are still the 𝑏 rightmost
ones).
Now, rectangle 𝑃 formed by the bottom 𝑛 − 𝑎 rows and the left 𝑎 columns
contains only positive numbers, as it contains no marked cells, as well as no
cells from row 𝑟. Let 𝑚 be the minimal number in that rectangle.
Let Elwyn add 𝑚 to all numbers in the rst 𝑎 rows, and subtract 𝑚 from
all numbers in the rst 𝑎 columns. All numbers which decrease after this
operation are situated in 𝑃 , so there appear no new cell containing a negative
number, and no negative number decreases. Moreover, by our choice, at least
one negative number (situated in row 𝑟 and column 𝑥) increases. Thus, the
badness decreases, as desired.
Case 2: Row 𝑟 is not among the 𝑎 chosen rows.
Add row 𝑟 to the 𝑎 chosen rows, and increase 𝑎 by 1. Notice that the
negative numbers in row 𝑟 are covered by the 𝑏 chosen columns. As in the
previous case, we permute the rows and columns so that the top 𝑎 rows and
the tight 𝑏 columns are chosen. All negative numbers in row 𝑟 automatically
come to the right 𝑏 columns. Now the above argument applies verbatim.

Step 2. We show that among the tables which Elwyn can obtain (call such
tables reachable ), there exists a table with the smallest badness. Applying the
argument in Step 1 to that table, we get that its badness is zero, which proves
the claim of the problem.
Notice that the eect of any sequence of Elwyn's moves has the form
described in Proposition 1. Moreover, subtraction of some number 𝜖 from all
the 𝑎𝑖 and the 𝑏𝑖 provides no eect on the result. Hence, we may assume that
the sums of the 𝑎𝑖 and of the 𝑏𝑖 are both zero.
Let 𝑡𝑖𝑗 denote the (𝑖, 𝑗)th entry of the initial table 𝑇 . For any two sequences
a = (𝑎1 , . . . , 𝑎𝑛 ) and b = (𝑏1 , . . . , 𝑏𝑛 ) both summing up to zero, denote by
𝑇 (a, b) the table obtained from 𝑇 by adding 𝑎𝑖 to all numbers in the 𝑖th row,
and subtracting 𝑏𝑗 from all numbers in the 𝑗 th column, for all 𝑖, 𝑗 = 1, 2, . . . , 𝑛;
in particular, 𝑇 = 𝑇 (0, 0), where 0 = (0, 0, . . . , 0). Let 𝑓 (a, b) denote the
badness of 𝑇 (a, b). Clearly, function 𝑓 is continuous. Now we intend to bound
the set of values that make sense to put in sequences a and b.
Let 𝑚 be the maximal number in 𝑇 . Take any a and b summing up to zero,
such that some 𝑎𝑖 is smaller than −𝑀 = −(𝑚+𝑏). Then there exists an index 𝑗
with 𝑏𝑗 ≥ 0; hence the entry (𝑖, 𝑗) in 𝑇 (a, b) is 𝑡𝑖𝑗 + 𝑎𝑖 − 𝑏𝑗 < 𝑚 − 𝑀 + 0 = −𝑏,
so 𝑓 (a, b) > 𝑏 = 𝑓 (0, 0).
So, all pairs of sequences a and b satisfying 𝑓 (a, b) ≤ 𝑏 should also satisfy
𝑎𝑖 ≥ −𝑀 and 𝑏𝑗 ≥ −𝑀 , and hence 𝑎𝑖 ≤ 𝑛𝑀 and 𝑏𝑗 ≤ 𝑛𝑀 as well (since
16 Solutions. XVII International Zhautykov Olympiad 2021

each of the sequences sums up to zero). Thus, in order to minimize 𝑓 (a, b), it
suces to consider only those a and b whose entries lie in [−𝑀, 𝑛𝑀 ]. Those
values form a compact set, so the continuous function 𝑓 attains the smallest
value on that set.

Addendum. Say that the price of Elwyn's move is the number 𝑎 chosen on
that move.
Proof of Proposition 1. Let Elwyn perform a move of price 𝑎 to row 𝑖 and
column 𝑗 , and then a move of price −𝑎 to row 𝑖′ and the same column 𝑗 . The
result will consist in adding 𝑎 to row 𝑖 and subtracting 𝑎 from row 𝑖′ . Similar
actions can be performed with columns.
So, Elwyn may add Σ = 𝑎1 + · · · + 𝑎𝑛 to the numbers in the rst row and
subtract Σ from those in the rst column, and then distribute those increments
and decrements among the rows and columns, using the above argument.
Proof of Proposition 2. It is easy to see, using Proposition 1, that Elwyn can
vanish all numbers in the rst column, as well as all numbers in the rst row,
except for the last its entry.
The resulting table is also balanced; denote the number in its cell (𝑖, 𝑗)
by 𝑑𝑖𝑗 . For any 𝑖, 𝑗 > 1 with 𝑗 < 𝑛, there are two rook sets 𝑅 and 𝑅′ , one
containing cells (1, 1) and (𝑖, 𝑗), and the other obtained by replacing those by
cells (1, 𝑗) and (𝑖, 1). The sums in those two sets are both zero, so
𝑑𝑖𝑗 = 𝑑𝑖1 + 𝑑1𝑗 − 𝑑11 = 0.
Hence, only the 𝑛th column of the obtained table might contain nonzero numbers.
But, since each entry in the 𝑛th column is contained in some (vanishing) rook
set, that entry is also zero.

Solution 3 (sketch). We implement some tools from multi-dimensional convex

geometry.
Each table can be regarded as a point in R𝑛×𝑛 . The set 𝐺 of good tables is
a convex cone determined by 𝑛! non-strict inequalities (claiming that the rook
sets are nonnegative). Thus this cone is closed.
The set 𝑇 of tables which can be transformed, by a sequence of Elwyn's
moves, into a table with nonnegative entries, is also a convex cone. This cone
is the Minkowski sum of the (closed) cone 𝑁 of all tables with nonnegative
entries and the linear subspace 𝑉 of all tables Elwyn can add by a sequence
of moves. Such sum is always closed (a pedestrian version of such argument is
presented in Step 2 of Solution 2).
It is easy to see that 𝑇 ⊆ 𝐺; we need to show that 𝑇 = 𝐺. Arguing indirectly,
assume that there is some table 𝑡 ∈ 𝐺 ∖ 𝑇 . Then there exists a linear function
Solutions. XVII International Zhautykov Olympiad 2021 17

𝑓 separating 𝑡 and 𝑇 , that is  𝑓 takes nonnegative values on 𝑇 but a negative

value on 𝑡.

This function 𝑓 has the following form: Let 𝑥 ∈ R𝑛×𝑛 be a table, and denote
by 𝑥𝑖𝑗 its (𝑖, 𝑗)th entry. Then

𝑛
∑︁
𝑓 (𝑥) = 𝑓𝑖𝑗 𝑥𝑖𝑗 ,
𝑖,𝑗=1

where 𝑓𝑖𝑗 are some real constants. Form a table 𝐹 whose (𝑖, 𝑗)th entry is 𝑓𝑖𝑗 .

Since 𝑓 (𝑥) ≥ 0 for all tables in 𝑁 having only one nonnegative entry, we have
𝑓𝑖𝑗 ≥ 0 for all 𝑖 and 𝑗 . Moreover, 𝑓 must vanish on all tables in the subspace 𝑉 ,
in particular  on each table having 1 in some row, −1 in some column, and
0 elsewhere (the intersection of the row and the column also contains 0). This
means that the sum of numbers in any row in 𝐹 is equal to the sum of the
numbers in any its column.

Now it remains to show that 𝐹 is the sum of several rook tables which
contain some nonnegative number 𝑝 at the cells of some rook set, while all
other entries are zero; this will yield 𝑓 (𝑡) ≥ 0 which is not the case. In other
words, it suces to prove that one can subtract from 𝐹 several rook tables to
make it vanish. This can be done by means of Hall's lemma again: if the table
is still nonzero, it contains 𝑛 positive entries forming a rook set, and one may
make one of them vanish, keeping the other entries nonnegative, by subtracting
a rook table.

№4. A circle with radius 𝑟 is inscribed in the triangle 𝐴𝐵𝐶 . Circles with radii
𝑟1 , 𝑟2 , 𝑟3 (𝑟1 , 𝑟2 , 𝑟3 < 𝑟) are inscribed in the angles 𝐴, 𝐵, 𝐶 so that each touches
the incircle externally. Prove that 𝑟1 + 𝑟2 + 𝑟3 ≥ 𝑟. (Sedrakyan N.)

First solution. Let 𝜔 be the incircle of △𝐴𝐵𝐶 , 𝐼 its center, and 𝑝 =

(𝐴𝐵 + 𝐵𝐶 + 𝐴𝐶)/2 its semiperimeter. We denote the tangency points of the
sides 𝐵𝐶 , 𝐴𝐶 , 𝐴𝐵 with 𝜔 by 𝐴0 , 𝐵0 , 𝐶0 respectively. Let the circle of radius
𝑟1 touches 𝜔 at 𝐴1 .
18 Solutions. XVII International Zhautykov Olympiad 2021

A
A
rr1011001100 A2222
rr11111 A ``
A11111
A B00000
B

C
C00000 II
C11111
C
B
B1111

B
B A
A00000 C
C

We draw a tangent ℓ to 𝜔 such that ℓ ‖ 𝐵𝐶 . Let 𝑟1′ be the inradius of the

triangle formed by the lines 𝐴𝐵 , 𝐴𝐶 , ℓ. The line 𝐴𝐼 intersects the circle of
radius 𝑟1′ at two points. From these two points let 𝐴2 be closest to 𝐼 . Then
𝑟1′
𝑟1′ = 𝐴𝐴2 ≥ 1 and 𝑟 = (here we use that the semiperimeter of the
𝑟1 𝐴𝐴1 𝐴𝐵0
𝑝
triangle formed by the lines 𝐴𝐵 , 𝐴𝐶 , ℓ equals 𝐴𝐵0 and that this triangle is
similar to △𝐴𝐵𝐶 ). Applying the same argument to the circles of raidii 𝑟2′ and
𝑟3′ and adding the obtained inequalities, we get
(︂ )︂
𝐴𝐵0 𝐵𝐶0 𝐶𝐵0
𝑟1 + 𝑟2 + 𝑟3 ≥ 𝑟1′ + 𝑟2′ + 𝑟3′ =𝑟 + + = 𝑟.
𝑝 𝑝 𝑝

Second solution. Let 𝐴0 , 𝐵0 , 𝐶0 , 𝐴1 , 𝐵1 , 𝐶1 retain the meaning they

had in the rst solution. We have ∠𝐵1 𝐼𝐶1 = 90∘ + ∠𝐴 ∘ ∠𝐵
2 , ∠𝐴1 𝐼𝐶1 = 90 + 2 ,
∠𝐴1 𝐼𝐵1 = 90∘ + ∠𝐶 2 . Obviously

(︁−−→ −−→ −−→)︁2

𝐼𝐴1 + 𝐼𝐵1 + 𝐼𝐶1 ≥ 0. (1)

It follows from (1) that

(︂ )︂ (︂ )︂ (︂ )︂
2 2 ∘ ∠𝐴 2 ∘ ∠𝐵 2 ∘ ∠𝐶
3𝑟 +2𝑟 cos 90 + +2𝑟 cos 90 + +2𝑟 cos 90 + ≥0 ⇔
2 2 2

(︂ )︂ (︂ )︂ (︂ )︂
∠𝐴 ∠𝐵 ∠𝐶 3
⇔ sin + sin + sin ≤ . (2)
2 2 2 2
Solutions. XVII International Zhautykov Olympiad 2021 19

A
A
II1111
rr1111 B00000
B
AA1111 H
H
rr
− rr11111
rr −
C
C00000
II C
C11111
B11111
B

B
B A00000
A C
C

Let 𝐼1 be the centre of the circle of radius 𝑟1 . Draw the perpendicular 𝐼1 𝐻

from 𝐼1 onto 𝐼𝐵0 . One of the acute angles in the right triangle 𝐼𝐼1 𝐻 is ∠𝐴 2 ,
the(︀leg )︀opposite this angle is 𝑟(︀− 𝑟1)︀, and the hypotenuse is 𝑟 + 𝑟 1 . Therefore
sin ∠𝐴 𝑟+𝑟1 . Similarly sin
= 𝑟−𝑟 𝑟+𝑟2 and sin
= 𝑟−𝑟 𝑟+𝑟3 . According
= 𝑟−𝑟
∠𝐵
(︀ ∠𝐶 )︀
1 2 3
2 2 2
to (2)

𝑟 − 𝑟1 𝑟 − 𝑟2 𝑟 − 𝑟3 3 2𝑟 2𝑟 2𝑟 9
+ + ≤ ⇔ + + ≤ . (3)
𝑟 + 𝑟1 𝑟 + 𝑟2 𝑟 + 𝑟3 2 𝑟 + 𝑟1 𝑟 + 𝑟2 𝑟 + 𝑟3 2

Applying Cauchy-Schwarz inequality we have

1 1 1 9
+ + ≥ , (4)
𝑟 + 𝑟1 𝑟 + 𝑟2 𝑟 + 𝑟3 𝑟 + 𝑟1 + 𝑟 + 𝑟2 + 𝑟 + 𝑟3

thus, (3) and (4) give 9

2 ≥ 18𝑟
3𝑟+𝑟1 +𝑟2 +𝑟3 ⇔ 𝑟1 + 𝑟2 + 𝑟3 ≥ 𝑟.
№5. On a party with 99 guests, hosts Ann and Bob play a game (the hosts are
not regarded as guests). There are 99 chairs arranged in a circle; initially, all
guests hang around those chairs. The hosts take turns alternately. By a turn,
a host orders any standing guest to sit on an unoccupied chair 𝑐. If some chair
adjacent to 𝑐 is already occupied, the same host orders one guest on such chair
to stand up (if both chairs adjacent to 𝑐 are occupied, the host chooses exactly
one of them). All orders are carried out immediately. Ann makes the rst move;
her goal is to fulll, after some move of hers, that at least 𝑘 chairs are occupied.
Determine the largest 𝑘 for which Ann can reach the goal, regardless of Bob's
play. (Bogdanov I.)

Answer. 𝑘 = 34.
20 Solutions. XVII International Zhautykov Olympiad 2021

Solution. Preliminary notes. Let 𝐹 denote the number of occupied chairs at

the current position in the game. Notice that, on any turn, 𝐹 does not decrease.
Thus, we need to determine the maximal value of 𝐹 Ann can guarantee after
an arbitrary move (either hers or her opponent's).
Say that the situation in the game is stable if every unoccupied chair is
adjacent to an occupied one. In a stable situation, we have 𝐹 ≥ 33, since at
most 3𝐹 chairs are either occupied or adjacent to such. Moreover, the same
argument shows that there is a unique (up to rotation) stable situation with
𝐹 = 33, in which exactly every third chair is occupied; call such stable situation
bad.

If the situation after Bob's move is stable, then Bob can act so as to preserve
the current value of 𝐹 indenitely. Namely, if 𝐴 puts some guest on chair 𝑎,
she must free some chair 𝑏 adjacent to 𝑎. Then Bob merely puts a guest on 𝑏
and frees 𝑎, returning to the same stable position.
On the other hand, if the situation after Bob's move is unstable, then Ann
may increase 𝐹 in her turn by putting a guest on a chair having no adjacent
occupied chairs.
Strategy for Ann, if 𝑘 ≤ 34. In short, Ann's strategy is to increase 𝐹 avoiding
appearance of a bad situation after Bob’s move (conversely, Ann creates a bad
.
situation in her turn, if she can)

So, on each her turn, Ann takes an arbitrary turn increasing 𝐹 if there is
no danger that Bob reaches a bad situation in the next turn (thus, Ann always
avoids forcing any guest to stand up). The exceptional cases are listed below.
Case 1. After possible Ann's move (consisting in putting a guest on chair 𝑎),
we have 𝐹 = 32, and Bob can reach a bad situation by putting a guest on some
chair. This means that, after Ann's move, every third chair would be occupied,
with one exception. But this means that, by her move, Ann could put a guest
on a chair adjacent to 𝑎, avoiding the danger.
Case 2. After possible Ann's move (by putting a guest on chair 𝑎), we have
𝐹 = 33, and Bob can reach a stable situation by putting a guest on some chair
𝑏 and freeing an adjacent chair 𝑐. If 𝑎 = 𝑐, then Ann could put her guest on 𝑏
to create a stable situation after her turn; that enforces Bob to break stability
in his turn. Otherwise, as in the previous case, Ann could put a guest on some
chair adjacent to 𝑎, still increasing the value of 𝐹 , but with no danger of bad
situation arising.
So, acting as described, Ann increases the value of 𝐹 on each turn of hers
whenever 𝐹 ≤ 33. Thus, she reaches 𝐹 = 34 after some her turn.
Strategy for Bob, if 𝑘 ≥ 35. Split all chairs into 33 groups each consisting of
three consecutive chairs, and number the groups by 1, 2, . . . , 33 so that Ann's
Solutions. XVII International Zhautykov Olympiad 2021 21

rst turn uses a chair from group 1. In short, Bob's strategy is to ensure, after
each his turn, that

(*) In group 1, at most two chairs are occupied; in every other

group, only the central chair may be occupied.

If (*) is satised after Bob's turn, then 𝐹 ≤ 34 < 𝑘 ; thus, property (*)
ensures that Bob will not lose.
It remains to show that Bob can always preserve (*). after any his turn.
Clearly, he can do that oat the rst turn.
Suppose rst that Ann, in her turn, puts a guest on chair 𝑎 and frees an
adjacent chair 𝑏, then Bob may revert her turn by putting a guest on chair 𝑏
and freeing chair 𝑎.
Suppose now that Ann just puts a guest on some chair 𝑎, and the chairs
adjacent to 𝑎 are unoccupied. In particular, group 1 still contains at most two
occupied chairs. If the obtained situation satises (*), then Bob just makes
a turn by putting a guest into group 1 (preferably, on its central chair), and,
possibly, removing another guest from that group. Otherwise, 𝑎 is a non-central
chair in some group 𝑖 ≥ 2; in this case Bob puts a guest to the central chair in
group 𝑖 and frees chair 𝑎.
So Bob indeed can always preserve (*).
№6. Let 𝑃 (𝑥) be a nonconstant polynomial of degree 𝑛 with rational coecients
which can not be presented as a product of two nonconstant polynomials with
rational coecients. Prove that the number of polynomials 𝑄(𝑥) of degree less
than 𝑛 with rational coecients such that 𝑃 (𝑥) divides 𝑃 (𝑄(𝑥))
a) is nite;
b) does not exceed 𝑛. (Golovanov A.)
Solution. It is known that an irreducible polynomial 𝑃 (𝑥) of degree 𝑛 with
rational coecients has 𝑛 dierent complex roots which we denote by 𝛼1 , 𝛼2 ,
. . . , 𝛼𝑛 .
a) If 𝑃 (𝑥) divides 𝑃 (𝑄(𝑥)), then 𝑄(𝛼𝑘 ) is also a root of 𝑃 (𝑥) for each 𝑘 ≤ 𝑛.
It follows that the values of 𝑄 at 𝛼1 , 𝛼2 , . . . , 𝛼𝑛 form a sequence 𝛼𝑖1 , 𝛼𝑖2 , . . . ,
𝛼𝑖𝑛 , where all terms are roots of 𝑃 , not necessarily dierent. The number of
such sequences is 𝑛𝑛 , and for each sequence there exists at most one polynomial
𝑄 such that 𝑄(𝛼𝑘 ) = 𝛼𝑖𝑘 (since two polynomials of degree less than 𝑛 with
equal values at 𝑛 points must coincide).
Thus the number of possible polynomials 𝑄(𝑥) does not exceed 𝑛𝑛 .
b) For each polynomial 𝑄 satisfying the condition, 𝑄(𝛼1 ) equals one of the
roots 𝛼𝑖 . However, there is at most one polynomial 𝑄 of degree less than 𝑛 with
rational coecients such that 𝑄(𝛼1 ) = 𝛼𝑖 , Indeed, if 𝑄1 (𝛼1 ) = 𝑄2 (𝛼1 ) = 𝛼𝑖 ,
then 𝛼1 is a root of the polynomial 𝑄1 −𝑄2 with rational coecients and degree
22 Solutions. XVII International Zhautykov Olympiad 2021

less than 𝑛. If this polynomial is not identically zero, its greatest common
divisor with 𝑃 is a nonconstant divisor of 𝑃 with rational coecients and
degree less than 𝑛, a contradiction.
Thus the number of possible polynomials 𝑄(𝑥) does not exceed 𝑛.
Solutions. XX “Silk Road” Mathematics Competition 2021 23

XX “Silk Road” Mathematics Competition 2021

№1. A sequence 𝑠 consisting of zeroes and ones is given. For each positive
integer 𝑘 we dene 𝑣𝑘 as the maximum number of ways to nd consecutive digits
forming the sequence 𝑠 in a sequence of 𝑘 digits. (For example, if 𝑠 = 0110, then
𝑣7 = 𝑣8 = 2, since in the sequences 0110110 and 01101100 consecutive digits
0110 are found in two places, and three pairs of ones surrounded by zeroes can
not occur in a sequence of 7 or 8 digits.) It is known that 𝑣𝑛 < 𝑣𝑛+1 < 𝑣𝑛+2 for
some positive integer 𝑛. Prove that all the digits in the sequence 𝑠 are identical.
(Golovanov A.)

Solution. Let the sequence 𝑠 = 𝑐1 𝑐2 . . . 𝑐𝑚 have length 𝑚, and some

sequence 𝑋 of length 𝑛 be 𝑎1 𝑎2 . . . 𝑎𝑛 . If two occurrences of 𝑠 in 𝑋 begin
with 𝑎𝑝 and 𝑎𝑝+𝑘 , then 𝑎𝑝+𝑖 = 𝑎𝑝+𝑖+𝑘 = 𝑐𝑖+1 for 0 ≤ 𝑖 < 𝑚. When 𝑘 ≤ 𝑚
this means that 𝑐𝑖 = 𝑐𝑖+𝑘 for 1 ≤ 𝑖 ≤ 𝑚 − 𝑘 , that is, 𝑠 is the beginning of
the (innite) periodic sequence 𝑎1 𝑎2 . . . 𝑎𝑘 𝑎1 𝑎2 . . . 𝑎𝑘 𝑎1 . . . with period 𝑘 . We
choose the minimum such 𝑘 ; if no such 𝑘 < 𝑚 exists, we let 𝑘 = 𝑚 (since 𝑠 is
obviously the beginning of the periodic sequence 𝑎1 𝑎2 . . . 𝑎𝑚 𝑎1 𝑎2 . . . 𝑎𝑚 𝑎1 . . . )
We have seen that the number of places in 𝑋 where the occurrences of 𝑠 begin
must dier at least by 𝑘 . If there are 𝑡 such occurrences, the last one should
begin at the place with number not less than 1 + 𝑘(𝑡 − 1), so 𝑚 + 𝑘(𝑡 − 1) ≤ 𝑛.
It follows that
[︀ the]︀ number of occurrences of 𝑠 in any sequence of length 𝑛 does
not exceed 𝑛−𝑚 𝑘 + 1.
On the other hand, an example of a sequence where 𝑠 can be found in this
number of ways, is given by the periodic sequence 𝑎1 𝑎2 . . . 𝑎𝑘 𝑎1 𝑎2 . . . 𝑎𝑘 𝑎1 . . .
We have proved that 𝑣𝑛 = 𝑛−𝑚 + 1, and the problem states that
[︀ ]︀
𝑘

[︂ ]︂ [︂ ]︂ [︂ ]︂
𝑛−𝑚 𝑛−𝑚+1 𝑛−𝑚+2
< < .
𝑘 𝑘 𝑘

If the inequality 𝑘𝑎 < 𝑎+1 holds for an integer 𝑎 and a positive integer 𝑘 ,
[︀ ]︀ [︀ ]︀
𝑘
then 𝑘 divides 𝑎 + 1 (since an integer which is greater than 𝑘𝑎 and not greater
than 𝑎+1𝑘 , can be presented as a fraction with denominator 𝑘 and therefore
equals 𝑎+1
𝑘 ). Therefore, the problem implies that 𝑘 divides both 𝑛 − 𝑚 + 1 and
𝑛 − 𝑚 + 2, which is possible for 𝑘 = 1 only. By the denition of 𝑘 we have
𝑐𝑖 = 𝑐𝑖+1 for 1 ≤ 𝑖 ≤ 𝑚 − 1, that is, every two consecutive digits in 𝑠 are equal.
Thus all the digits of 𝑠 are equal.
√
№2. For every positive integer 𝑚 prove the inequality |{ 𝑚} − 21 | > 8(√𝑚+1) 1
.
(Golovanov A.)
24 Solutions. XX “Silk Road” Mathematics Competition 2021

√
Solution. Let [ 𝑚] = 𝑘 . Then

√ 1 1 √ 1 |4𝑘 2 + 4𝑘 + 1 − 4𝑚|
|{ 𝑚} − | = |2𝑘 + 1 − 2 𝑚| = · √ .
2 2 2 2𝑘 + 1 + 2 𝑚

The numerator of the last fraction is ann odd positive integer, and therefore at
least 1. Thus,
√ 1 1 1 1 1
|{ 𝑚} − | ≥ · √ ≥ √ > √ ,
2 2 2𝑘 + 1 + 2 𝑚 2(4 𝑚 + 1) 8( 𝑚 + 1)

Q.E.D.
№3. Let 𝑀 be the midpoint of side 𝐴𝐵 in triangle 𝐴𝐵𝐶 . 𝐵1 is a point on
segment 𝐴𝐶 such that 𝐶𝐵 = 𝐶𝐵1 . The circumcircles of triangles 𝐴𝐵𝐶 and
𝐵𝑀 𝐵1 , 𝜔 and 𝜔1 , intersect for the second time at point 𝐾 . Let 𝑄 be the
midpoint of arc 𝐴𝐶𝐵 of 𝜔 . Lines 𝐵1 𝑄 and 𝐵𝐶 intersect at point 𝐸 . Prove that
line 𝐾𝐶 passes through the midpoint of segment 𝐵1 𝐸 . (Kungozhin M.)

Solution. Let the bisector of ∠𝐴𝐶𝐵 intersect 𝜔 for the second time at
point 𝑁 . Note that 𝑁 is the midpoint of arc 𝐴𝐵 (that does not contain 𝐶 ) of
𝜔 . Also, it is easy to see that line 𝐶𝑁 is the perpendicular bisector of segment
𝐵𝐵1 . Thus, 𝑁 𝐴 = 𝑁 𝐵 = 𝑁 𝐵1 , i.e. points 𝐴, 𝐵 and 𝐵1 lie on a circle centered
at 𝑁 with radius 𝑁 𝐴. Since ∠𝑁 𝐴𝑄 = ∠𝑁 𝐵𝑄 = 90∘ , then lines 𝑄𝐴 and
𝑄𝐵 are tangent to this circle. Therefore, line 𝑄𝐵1 contains the symmedian of
triangle 𝐴𝐵𝐵1 corresponding to vertex 𝐵1 .

R
R

E
E
Q
Q
K
K C
C
P
P
B
B1111
ω11111
ω

A
A B
B
M
M
ω
ω

N
N
Solutions. XX “Silk Road” Mathematics Competition 2021 25

Let line 𝐾𝐶 intersect 𝜔1 for the second time at point 𝑃 . From the properties
of symmedian it follows that

∠(𝐵1 𝐶, 𝐵1 𝐸) = ∠(𝐵1 𝐶, 𝐵1 𝑄) = ∠(𝐵1 𝑀, 𝐵1 𝐵) = ∠(𝑃 𝑀, 𝑃 𝐵) = 𝛼. (1)

Also, the following equalities hold:

∠(𝐶𝐾, 𝐶𝐴) = ∠(𝐵𝐾, 𝐵𝐴) = ∠(𝐵𝐾, 𝐵𝑀 ) = ∠(𝑃 𝐾, 𝑃 𝑀 ) = 𝛽. (2)

From (1) and (2) it follows that ∠(𝑃 𝐾, 𝐵1 𝐸) = ∠(𝐶𝐾, 𝐵1 𝐸) = 𝛼 + 𝛽 =

∠(𝑃 𝐾, 𝑃 𝐵). The latter equality gives

𝐵1 𝐸 ‖ 𝑃 𝐵. (3)

Let line 𝐵𝑃 intersect line 𝐴𝐶 at point 𝑅. Then, from (2) it follows that
𝐶𝐴 ‖ 𝑃 𝑀 , or that 𝑀 𝑃 is a midsegment of triangle 𝐴𝑅𝐵 , i.e. 𝑃 is the midpoint
of segment 𝐵𝑅. Now it is enough to note that if line 𝐾𝐶 bisects segment 𝐵𝑅,
then it also bisects segment 𝐵1 𝐸 , since (3) holds.
№4. Integers 𝑥, 𝑦 , 𝑧 , 𝑡 satisfy 𝑥2 + 𝑦 2 = 𝑧 2 + 𝑡2 and 𝑥𝑦 = 2𝑧𝑡. Prove that
𝑥𝑦𝑧𝑡 = 0. (Abduvaliev M.)

Solution. Assume that 𝑥𝑦𝑧𝑡 ̸= 0.

If three of the numbers 𝑥, 𝑦 , 𝑧 , 𝑡 have a common divisor 𝑑, the remaining
number is also a multiple of 𝑑. The division of all the four numbers by 𝑑
preserves the validity of our equations. Since 𝑥, 𝑦 , 𝑧 , 𝑡 are not zero, we can
divide them by their greatest common divisor and henceforth assume that they
are coprime.
The numbers 𝑥 and 𝑦 can not be both odd (since 𝑥𝑦 is even) or both even
(since in this case 𝑧𝑡 is also even and at least three of the numbers 𝑥, 𝑦 , 𝑧 , 𝑡
are even). Thus 𝑥 and 𝑦 and therefore 𝑧 and 𝑡 have dierent parity.
Denote 𝑠 = 𝑥2 + 𝑦 2 , 𝑛 = 𝑧𝑡. Without loss of generality, 𝑛 > 0.
The condition on 𝑥, 𝑦 , 𝑧 , 𝑡 means that 𝑠 − 4𝑛, 𝑠 − 2𝑛, 𝑠 + 2𝑛, 𝑠 + 4𝑛 are
perfect squares. We will prove that this is not possible for any odd 𝑠 and positive
𝑛. First, we nd a statement equivalent to these four numbers being squares.
Their product (𝑠2 − 4𝑛2 )(𝑠2 − 16𝑛2 ) = (𝑠2 − 10𝑛2 )2 − 36𝑛4 is a square of some
odd 𝑇 . The numbers 𝑇 , 6𝑛2 , 𝑠2 − 10𝑛2 form a primitive Pythagorean triple,
hence there exist coprime 𝑢, 𝑣 of dierent parity such that 2𝑢𝑣 = 6𝑛2 and
𝑢2 + 𝑣 2 = 𝑠2 − 10𝑛2 . Since 𝑢 and 𝑣 are coprime, it follows from 𝑢𝑣 = 3𝑛2 that
one of these numbers is a square and another is a triple square. Without loss of
generality, assume that 𝑢 = 3𝑘 2 and 𝑣 = ℓ2 ; 𝑘 and ℓ are coprime. Multiplying
𝑢2 + 𝑣 2 = 𝑠2 − 10𝑛2 by 3 we get 3𝑠2 − 30𝑛2 = 3𝑠2 − 10𝑢𝑣 = 3𝑢2 + 3𝑣 2 , that
is, 3𝑠2 = 3𝑢2 + 10𝑢𝑣 + 3𝑣 2 = (3𝑢 + 𝑣)(3𝑣 + 𝑢), where 3𝑢 + 𝑣 and 3𝑣 + 𝑢 are
26 Solutions. XX “Silk Road” Mathematics Competition 2021

coprime (they have dierent parity, and their common divisor must also divide
8𝑢 = 3(3𝑢 + 𝑣) − (3𝑣 + 𝑢) and, similarly, 8𝑣 ). It follows that one of the numbers
3𝑢 + 𝑣 and 3𝑣 + 𝑢 is a square and another is a triple square. Since 3 does
not divide 3𝑢 + 𝑣 , the square is 3𝑢 + 𝑣 = 9𝑘 2 + ℓ2 , and the triple square is
𝑢 + 3𝑣 = 3(𝑘 2 + ℓ2 ). We have proved that the original equations imply the
existence of coprime 𝑘 and ℓ such that 9𝑘 2 + ℓ2 and 𝑘 2 + ℓ2 are perfect squares.
It remains to prove that there are no such 𝑘 , ℓ. If 𝑘 2 + ℓ2 and 9𝑘 2 + ℓ2
are perfect squares, the pairs (𝑘, ℓ) and (3𝑘, ℓ) are pairs of legs in primitive
Pythagorean triples. Unfortunately, we do not know which of the numbers 𝑘
and ℓ is even, so two cases are possible. But let's prove the following lemma
rst.

Lemma. Let 𝑎, 𝑏, 𝑐, 𝑑 be pairwise coprime positive integers such that 𝑐2 (𝑎2 +

𝑑 ) = 𝑏2 (9𝑎2 + 𝑑2 ). Then, 𝑎2 + 𝑑2 and 9𝑎2 + 𝑑2 are perfect squares.
2

Proof. Since 𝐺𝐶𝐷(𝑏, 𝑐) = 1, then there exists such positive integer 𝑓 that

𝑎2 + 𝑑2 = 𝑏2 𝑓, 9𝑎2 + 𝑑2 = 𝑐2 𝑓.

𝑓 = 𝐺𝐶𝐷(𝑎2 + 𝑑2 , 9𝑎2 + 𝑑2 ) =⇒ 𝑓 | 8𝑎2 , 𝑓 | 8𝑑2 .

𝐺𝐶𝐷(𝑎, 𝑑) = 1 =⇒ 𝑓 | 8.
If 𝑎, 𝑑 are of dierent parity, then 𝑎2 + 𝑑2 is odd, and therefore 𝑓 = 1. Let both
𝑎 and 𝑑 be odd (they can't be simultaneously even). Then

𝑎2 + 𝑑2 ≡ 2 (mod 8) =⇒ 𝑓 | 2.

Let 𝑓 = 2.

9𝑎2 + 𝑑2 = 𝑐2 𝑓 = 2𝑐2 =⇒ 𝑑2 ≡ 2𝑐2 (mod 3) =⇒ 3 | 𝑐, 3|𝑑

 a contradiction, since 𝐺𝐶𝐷(𝑐, 𝑑) = 1. Thus, 𝑓 = 1, 𝑎2 +𝑑2 = 𝑏2 , 9𝑎2 +𝑑2 = 𝑐2 .

The lemma is proven.

Case 1. 𝑘 is even. Then 𝑘 = 2𝑢1 𝑣1 , 3𝑘 = 2𝑢2 𝑣2 , ℓ = 𝑢21 − 𝑣12 = 𝑢22 − 𝑣22 ,

where (𝑢1 , 𝑣1 ) and (𝑢2 , 𝑣2 ) are two pairs of coprime numbers with dierent
parity. Since 𝑢2 𝑣2 = 3𝑢1 𝑣1 , then there exist pairwise coprime positive integers
𝑎, 𝑏, 𝑐, 𝑑 such that 𝑢2 = 3𝑎𝑏, 𝑣2 = 𝑐𝑑, 𝑢1 = 𝑎𝑐, 𝑣1 = 𝑏𝑑 (the case when 𝑢2 is not
divisible by 3 can be considered similarly). Substituting this in the expression
for ℓ we obtain 𝑎2 𝑐2 + 𝑐2 𝑑2 = 9𝑎2 𝑏2 + 𝑏2 𝑑2 , or 𝑐2 (𝑎2 + 𝑑2 ) = 𝑏2 (9𝑎2 + 𝑑2 ).
Solutions. XX “Silk Road” Mathematics Competition 2021 27

According to the lemma, 𝑎2 + 𝑑2 and 9𝑎2 + 𝑑2 are squares, and, obviously,

𝑎 < 𝑘 , 𝑑 < ℓ.
Case 2. ℓ is even. Then 𝑘 = 𝑢21 − 𝑣12 , 3𝑘 = 𝑢22 − 𝑣22 , ℓ = 2𝑢1 𝑣1 = 2𝑢2 𝑣2 .
Since (𝑢2 − 𝑣2 )(𝑢2 + 𝑣2 ) = 3(𝑢1 − 𝑣1 )(𝑢1 + 𝑣1 ), then we have 𝑢1 − 𝑣1 = 𝑎𝑏,
𝑢1 + 𝑣1 = 𝑐𝑑, 𝑢2 − 𝑣2 = 𝑎𝑐, 𝑢2 + 𝑣2 = 3𝑏𝑑 for some pairwise coprime positive
integers 𝑎, 𝑏, 𝑐, 𝑑 (the case when 𝑢2 + 𝑣2 is not divisible by 3 can be considered
similarly). Expressing 𝑢1 , 𝑣1 , 𝑢2 , 𝑣2 in terms of 𝑎, 𝑏, 𝑐, 𝑑 and putting the result
in the formula for ℓ, we get (𝑎𝑏 + 𝑐𝑑)(𝑐𝑑 − 𝑎𝑏) = (3𝑏𝑑 + 𝑎𝑐)(3𝑏𝑑 − 𝑎𝑐), that is,
𝑐2 (𝑎2 + 𝑑2 ) = 𝑏2 (𝑎2 + 9𝑑2 ). Hence, by the lemma, we obtain that 𝑎2 + 𝑑2 and
𝑎2 + 9𝑑2 are perfect squares, and 𝑎 < ℓ, 𝑑 < 𝑘 .
In both cases, for each pair (𝑘, ℓ) such that 𝑘 2 + ℓ2 and 9𝑘 2 + ℓ2 are perfect
squares we constructed a pair of smaller numbers with the same property. It
follows that such numbers do not exist. Thus, the original system does not
admit a solution in non-zero integers.
28 Solutions. Республиканская олимпиада 2021 года. 9 класс

Республиканская олимпиада 2021 года. 9 класс

№1. Ïóñòü 𝑎, 𝑏, 𝑐  ïîëîæèòåëüíûå äåéñòâèòåëüíûå ÷èñëà òàêèå, ÷òî

1 19
𝑎+𝑏+𝑐+ = .
𝑎𝑏𝑐 2
Íàéäèòå íàèáîëüøåå âîçìîæíîå çíà÷åíèå 𝑎. (Anuarbekov T.)

Ответ. 8.
√
Решение. Ïóñòü 𝑥 = 𝑎. Ïî íåðàâåíñòâó ìåæäó ñðåäíèì àðèôìåòè-
3

÷åñêèì è ãåîìåòðè÷åñêèì ïîëó÷èì, ÷òî

(︂ )︂ √︂
19 1 1 3
= 𝑥3 + =⇒
3
=𝑎+ 𝑏+𝑐+ ≥𝑎+3 𝑏·𝑐·
2 𝑎𝑏𝑐 𝑎𝑏𝑐 𝑥

=⇒ 2𝑥4 + 6 ≤ 19𝑥 =⇒ (𝑥 − 2)(2𝑥3 + 4𝑥2 + 8𝑥 − 3) ≤ 0.

Ïîñëåäíåå íåðàâåíñòâî íåâåðíî ïðè 𝑥 > 2 (÷èñëà â êàæäîé ñêîáêå áóäóò ïî-
ëîæèòåëüíûìè), îòêóäà 𝑥 ≤ 2. Çíà÷èò 𝑎 ≤ 8.  êà÷åñòâå ïðèìåðà ïîäõîäèò
1
÷èñëà 𝑎 = 8, 𝑏 = 𝑐 = .
2
№2. Íà ïîëêå ñòîÿò â áåñïîðÿäêå 100 òîìîâ ýíöèêëîïåäèè, çàíóìåðîâàí-
íûõ âñåìè íàòóðàëüíûìè ÷èñëàìè îò 1 äî 100. Çà îäíó îïåðàöèþ ìîæíî
âçÿòü è ëþáûì ñïîñîáîì ïåðåñòàâèòü íà ñâîèõ ìåñòàõ ëþáûå òðè òîìà
(ò.å. åñëè ýòè òîìà ñòîÿëè â ìåñòàõ 𝑎, 𝑏, 𝑐, òî ïîñëå ýòîé îïåðàöèè ýòè òî-
ìà òàêæå áóäóò ñòîÿòü â ìåñòàõ 𝑎, 𝑏, 𝑐, íî âîçìîæíî â äðóãîì ïîðÿäêå).
Ïðè êàêîì íàèìåíüøåì 𝑚 ìîæíî óòâåðæäàòü, ÷òî 𝑚 òàêèìè îïåðàöèÿìè
óäàñòñÿ ðàññòàâèòü âñå òîìà ïî ïîðÿäêó, êàê áû îíè íè áûëè ðàññòàâëåíû
ïåðâîíà÷àëüíî? (Òîìà ñòîÿò ïî ïîðÿäêó, åñëè 1-é òîì ñòîèò íà 1-ì ìåñòå,
2-é òîì íà 2-ì, ..., 100-é òîì íà 100-ì ìåñòå.) (Golovanov A.)

Ответ. 50.

Решение. Äîêàæåì, ÷òî 50 îïåðàöèé âñåãäà äîñòàòî÷íî. Îäíà îïåðà-

öèÿ ïîçâîëÿåò ïîñòàâèòü íà ìåñòî äâà òîìà: åñëè òîìà ñ íîìåðîì 𝑎 ñòîèò
íà ìåñòå òîìà 𝑏 ̸= 𝑎, à òîì 𝑏  íà ìåñòå òîìà 𝑐, òî ïðè 𝑐 ̸= 𝑎 ìîæíî ïîñòà-
âèòü 𝑎 è 𝑏 íà ñâîè ìåñòà, à íà ìåñòî òîìà 𝑐 ïîñòàâèòü òîò, êîòîðûé ñåé÷àñ
ñòîèò íà ìåñòå 𝑎. Åñëè æå 𝑐 = 𝑎, ìîæíî ïðîñòî ïîìåíÿòü ìåñòàìè 𝑎 è 𝑏,
ôîðìàëüíî äîáàâèâ â òðîéêó ëþáîé èç îñòàâøèõñÿ òîìîâ.
Äîêàæåì, ÷òî ðàññòàíîâêó òîìîâ 100, 1, 2, . . . , 99 íåëüçÿ ïðèâåñòè â ïî-
ðÿäîê ìåíüøèì ÷èñëîì îïåðàöèé. Äëÿ ïðîèçâîëüíîé ïåðåñòàíîâêè òîìîâ
Solutions. Республиканская олимпиада 2021 года. 9 класс 29

ðàññìîòðèì îðèåíòèðîâàííûé ãðàô, âåðøèíàìè êîòîðîãî ñëóæàò òîìà, à

ñòðåëêà îò êàæäîãî òîìà èä¼ò ê òîìó, êîòîðûé ñòîèò íà åãî ìåñòå. Ïîñêîëü-
êó â êàæäîé âåðøèíå åñòü ïî îäíîé âõîäÿùåé è âûõîäÿùåé ñòðåëêå, ýòîò
ãðàô ïðåäñòàâëÿåò ñîáîé îáúåäèíåíèå öèêëîâ áåç îáùèõ âåðøèí. Ïåðåñòà-
íîâêå 100, 1, 2, . . . , 99 ñîîòâåòñòâóåò ãðàô èç îäíîãî öèêëà, à ðàññòàíîâêå
ïî ïîðÿäêó  ãðàô èç 100 öèêëîâ (â êàæäîì èç êîòîðûõ ïî îäíîé âåðøèíå).
Åñëè ïîìåíÿòü ìåñòàìè äâà òîìà, òî åñòü ïîìåíÿòü ìåñòàìè êîíöû äâóõ
ñòðåëîê, îñòàâèâ íà ìåñòå èõ íà÷àëà, êîëè÷åñòâî öèêëîâ èçìåíèòñÿ íà 1
(åñëè ñòðåëêè ïðèíàäëåæàëè îäíîìó öèêëó, îí ðàñïàä¼òñÿ íà äâà, à åñëè
äâóì ðàçíûì, ýòè öèêëû îáúåäèíÿòñÿ). Ëþáàÿ ïåðåñòàíîâêà òð¼õ òîìîâ
ïîëó÷àåòñÿ íå áîëåå, ÷åì äâóìÿ îáìåíàìè äâóõ òîìîâ. Ýòî îçíà÷àåò, ÷òî
íàøà îïåðàöèÿ ìåíÿåò êîëè÷åñòâî öèêëîâ íå áîëåå, ÷åì íà 2, è ïîëó÷èòü
100 öèêëîâ èç îäíîãî ìåíåå, ÷åì çà 50 îïåðàöèé íåâîçìîæíî.
№3. Ïðîäîëæåíèÿ ñòîðîí 𝐴𝐵 è 𝐶𝐷 âûïóêëîãî ÷åòûðåõóãîëüíèêà 𝐴𝐵𝐶𝐷
ïåðåñåêàþòñÿ â òî÷êå 𝑃 , à äèàãîíàëè 𝐴𝐶 è 𝐵𝐷  â òî÷êå 𝑄. Òî÷êè 𝑀 è 𝑁
 ñåðåäèíû äèàãîíàëåé 𝐴𝐶 è 𝐵𝐷 ñîîòâåòñòâåííî. Îïèñàííûå îêðóæíîñòè
òðåóãîëüíèêîâ 𝐵𝐶𝑄 è 𝑀 𝑁 𝑄 ïåðåñåêàþòñÿ â òî÷êå 𝑇 (𝑇 ̸= 𝑄). Äîêàæè-
òå, ÷òî åñëè ∠𝐴𝑃 𝐷 = 90∘ , òî ïðÿìàÿ 𝑃 𝑇 äåëèò îòðåçîê 𝑀 𝑁 ïîïîëàì.
(Kungozhin M.)

Решение. Ïóñòü 𝐿  ñåðåäèíà îòðåçêà 𝑀 𝑁 . Òàê êàê òî÷êè 𝑀, 𝑇, 𝑁, 𝑄

ëåæàò íà îäíîé îêðóæíîñòè, òî ∠𝑇 𝑀 𝐶 = ∠𝑇 𝑁 𝐵 . Àíàëîãè÷íî ∠𝑇 𝐵𝑁 =
∠𝑇 𝐶𝑀 . Ñëåäîâàòåëüíî, △𝑇 𝑀 𝐶 ∼ △𝑇 𝑁 𝐵 . Çíà÷èò
𝑇𝑀 𝐶𝑀 𝑃𝑀
= = . (1)
𝑇𝑁 𝐵𝑁 𝑃𝑁
Çàìåòèì, ÷òî ∠𝑀 𝑃 𝑁 = 90∘ −(∠𝐷𝑃 𝑁 +∠𝐴𝑃 𝑀 ) = 90∘ −(∠𝑃 𝐴𝐶 +∠𝑃 𝐷𝐵) =
∠𝐴𝐶𝑃 − ∠𝑃 𝐷𝐵 = ∠𝐶𝑄𝐷 = ∠𝑀 𝑄𝑁 = 180∘ − ∠𝑀 𝑇 𝑁 . Ñëåäîâàòåëüíî,
∠𝑀 𝑇 𝑁 + ∠𝑀 𝑃 𝑁 = 180∘ . Ïóñòü 𝑇 ′ − îáðàç òî÷êè 𝑇 ïðè ñèììåòðèè îòíî-
ñèòåëüíî òî÷êè 𝐿. Òîãäà 𝑀 𝑇 𝑁 𝑇 ′  ïàðàëëåëîãðàìì. Òàê êàê ∠𝑀 𝑇 ′ 𝑁 +
∠𝑀 𝑃 𝑁 = 180∘ , òî òî÷êè 𝑃, 𝑀, 𝑁, 𝑇 ′ ëåæàò íà îäíîé îêðóæíîñòè. Òàêæå
èç (1) ñëåäóåò, ÷òî
𝑀 𝑇 ′ · 𝑀 𝑃 = 𝑁 𝑇 · 𝑀 𝑃 = 𝑁 𝑃 · 𝑀 𝑇 = 𝑁 𝑇 ′ · 𝑁 𝑃. (2)
Òàê êàê sin 𝑥 = sin(180∘ − 𝑥), òî èñïîëüçóÿ (2) ïîëó÷èì, ÷òî
1 1
𝑆(𝑃 𝑀 𝑇 ′ ) = ·𝑀 𝑇 ′ ·𝑀 𝑃 ·sin ∠𝑃 𝑀 𝑇 ′ = ·𝑁 𝑇 ′ ·𝑁 𝑃 ·sin ∠𝑃 𝑁 𝑇 ′ = 𝑆(𝑃 𝑁 𝑇 ′ ).
2 2
(Çäåñü 𝑆(𝑋𝑌 𝑍) îçíà÷àåò ïëîùàäü òðåóãîëüíèêà 𝑋𝑌 𝑍 .) Ïóñòü 𝑃 𝑇 ′ ∩𝑀 𝑁 =
𝑅. Çàìåòèì, ÷òî
𝑃 𝑇 ′ · 𝑀 𝑅 · sin ∠𝑃 𝑅𝑀 = 2𝑆(𝑃 𝑀 𝑇 ′ ) = 2𝑆(𝑃 𝑁 𝑇 ′ ) = 𝑃 𝑇 ′ · 𝑁 𝑅 · ∠𝑇 ′ 𝑅𝑁,
30 Solutions. Республиканская олимпиада 2021 года. 9 класс

îòêóäà 𝑀 𝑅 = 𝑅𝑁 . Çíà÷èò 𝑅 = 𝐿. Òîãäà òî÷êè 𝑃 , 𝑇, 𝐿 è 𝑇 ′ ëåæàò íà îäíîé

ïðÿìîé, ÷òî è òðåáîâàëîñü äîêàçàòü.

P
P

B
B

TT N
N C
C
L
L
M
M Q
Q
TT 00000
TT
A
A D
D

№4. Òðåóãîëüíèê 𝐴𝐵𝐶 (𝐴𝐶 > 𝐵𝐶 ) âïèñàí â îêðóæíîñòü 𝜔 . Áèññåêòðèñà

𝐶𝑁 ýòîãî òðåóãîëüíèêà ïåðåñåêàåò 𝜔 â òî÷êå 𝑀 (𝑀 ̸= 𝐶 ). Íà îòðåçêå
𝐵𝑁 îòìå÷åíà ïðîèçâîëüíàÿ òî÷êà 𝑇 . Ïóñòü 𝐻  îðòîöåíòð òðåóãîëüíèêà
𝑀 𝑁 𝑇 . Îïèñàííàÿ îêðóæíîñòü òðåóãîëüíèêà 𝑀 𝑁 𝐻 ïåðåñåêàåò 𝜔 â òî÷êå
𝑅 (𝑅 ̸= 𝑀 ). Äîêàæèòå, ÷òî ∠𝐴𝐶𝑇 = ∠𝐵𝐶𝑅. (Kungozhin M.)

Решение. Ïóñòü 𝑇 ′  îáðàç òî÷êè 𝑇 ïðè ñèììåòðèè îòíîñèòåëüíî ïðÿ-

ìîé 𝐶𝑁 . Òîãäà ∠𝑁 𝐻𝑀 = 90∘ − ∠𝐻𝑀 𝑇 = ∠𝑁 𝑇 𝑀 = ∠𝑁 𝑇 ′ 𝑀. Çíà÷èò òî÷-
êè 𝑀, 𝑁, 𝐻, 𝑇 ′ è 𝑅 ëåæàò íà îäíîé îêðóæíîñòè. Òîãäà ∠𝑇 ′ 𝑅𝑀 = 180∘ −
∠𝑇 ′ 𝑁 𝑀 = 180∘ −∠𝑇 𝑁 𝑀 = ∠𝐶𝑁 𝐵 = ∠𝐶𝐴𝐵+∠𝐴𝐶𝑀 = ∠𝐶𝐴𝐵+∠𝐵𝐴𝑀 =
∠𝐶𝐴𝑀 = ∠𝐶𝑅𝑀. Ñëåäîâàòåëüíî, òî÷êè 𝑅, 𝑇 ′ , 𝐶 ëåæàò íà îäíîé ïðÿìîé.
Îòêóäà ∠𝐵𝐶𝑅 = ∠𝐵𝐶𝑇 ′ = ∠𝐴𝐶𝑇 , ÷òî è òðåáîâàëîñü äîêàçàòü.

C
C

TT 00000 H
H
A
A B
B
N
N TT
R
R

M
M
Solutions. Республиканская олимпиада 2021 года. 9 класс 31

№5. Ñóùåñòâóþò ëè ïîïàðíî ðàçëè÷íûå íàòóðàëüíûå ÷èñëà 𝑎1 , 𝑎2 , . . . , 𝑎100 ,

îäíîâðåìåííî óäîâëåòâîðÿþùèå ñëåäóþùèì óñëîâèÿì:
i ) ÷èñëî 𝑎1 𝑎2 . . . 𝑎100 äåëèòñÿ íà 𝑎𝑖 + 𝑎𝑗 ïðè âñåõ 1 ≤ 𝑖 < 𝑗 ≤ 100;
ii ) äëÿ êàæäîãî 𝑘 = 1, 2, . . . , 100 íàéäóòñÿ èíäåêñû 𝑖, 𝑗 òàêèå, ÷òî 1 ≤
𝑖 < 𝑗 ≤ 100 è ÷èñëî
𝑎1 𝑎2 . . . 𝑎𝑘−1 𝑎𝑘+1 . . . 𝑎100 íå äåëèòñÿ íà 𝑎𝑖 + 𝑎𝑗 ? (Golovanov A.)

Ответ. Äà, ñóùåñòâóþò.

Решение. Âîçüì¼ì êàêîå-íèáóäü ïðîñòîå ÷èñëî 𝑝 > 200 è ÷èñëà 𝑎1 ,

. . . , 𝑎100 òàêèå, ÷òî 𝑎𝑖 ≡ 𝑝𝑖 (mod 𝑝101 ) ïðè 1 ≤ 𝑖 ≤ 99 è 𝑎100 ≡ 𝑝100 − 𝑝
(mod 𝑝101 ). Ïðè ýòîì, î÷åâèäíî, êàæäîå èç 100 ÷èñåë 𝑎𝑖 áóäåò ñîäåðæàòü
𝑝 ðîâíî â ïåðâîé ñòåïåíè, ñóììà 𝑎1 + 𝑎100 â ñîòîé, à îñòàëüíûå ïîïàð-
íûå ñóììû  â ïåðâîé. Ñëåäîâàòåëüíî, ïðîèçâåäåíèå âñåõ 100 ÷èñåë áóäåò
ñîäåðæàòü 𝑝 íå â ìåíüøåé ñòåïåíè, ÷åì ëþáàÿ èç ïîïàðíûõ ñóìì, à ïðîèç-
âåäåíèå ëþáûõ 99  â ìåíüøåé ñòåïåíè, ÷åì ñóììà 𝑎1 + 𝑎100 .
Ìîæåò ñëó÷èòüñÿ, ÷òî íåêîòîðîå ïðîñòîå 𝑞 ̸= 𝑝 ñîäåðæèòñÿ â ïðîèç-
âåäåíèè 𝑎1 . . . 𝑎100 â ìåíüøåé ñòåïåíè, ÷åì â êàêîé-òî èç ïîïàðíûõ ñóìì.
Åñëè äîìíîæèòü âñå 𝑎𝑖 íà 𝑞 , òî ñòåïåíü, â êîòîðîé 𝑞 ñîäåðæèòñÿ â êàæäîé
èç ïîïàðíûõ ñóìì, óâåëè÷èòñÿ íà 1, à ñòåïåíü âõîæäåíèÿ 𝑞 â ïðîèçâåäåíèå
âñåõ ÷èñåë  íà 100. Ïðîäåëàâ òàêèå îïåðàöèè äîñòàòî÷íî ìíîãî ðàç, ìû
äîáü¼ìñÿ òîãî, ÷òîáû âñå 𝑞 ̸= 𝑝 âõîäèëè â ïðîèçâäåíèå âñåõ ÷èñåë íå â ìåíü-
øåé ñòåïåíè, ÷åì â ëþáóþ èç ïîïàðíûõ ñóìì. Ïðè ýòîì, î÷åâèäíî, ñòåïåíè
âõîæäåíèÿ 𝑝 â ýòè ÷èñëà íå èçìåíÿòñÿ, è íîâûå ÷èñëà áóäóò óäîâëåòâîðÿòü
óñëîâèþ çàäà÷è.
№6. Äàíî íàòóðàëüíîå ÷èñëî 𝑛. Ïîñëåäîâàòåëüíîñòü (𝑥1 , 𝑥2 , . . . , 𝑥𝑛 ) äåé-
ñòâèòåëüíûõ ÷èñåë íàçûâàåòñÿ хорошей , åñëè

𝑥31 + 𝑥32 + . . . + 𝑥3𝑖 = (𝑥1 + 𝑥2 + . . . + 𝑥𝑖 )2

äëÿ êàæäîãî 𝑖 = 1, 2, . . . , 𝑛. Äîêàæèòå, ÷òî êîëè÷åñòâî ðàçëè÷íûõ õîðî-

øèõ ïîñëåäîâàòåëüíîñòåé íå áîëüøå ÷åì 3𝑛−1 + 2𝑛−1 . (Ïîñëåäîâàòåëüíî-
ñòè (𝑥1 , 𝑥2 , . . . , 𝑥𝑛 ) è (𝑦1 , 𝑦2 , . . . , 𝑦𝑛 ) ñ÷èòàþòñÿ ðàçëè÷íûìè, åñëè 𝑥𝑖 ̸= 𝑦𝑖
õîòÿ áû äëÿ îäíîãî 𝑖 = 1, 2, . . . , 𝑛.) (Sedrakyan N.)

Решение. Îáîçíà÷èì ÷åðåç 𝑔(𝑛) êîëè÷åñòâî õîðîøèõ ïîñëåäîâàòåëü-

íîñòåé äëèíû 𝑛. Èíäóêöèåé ïî 𝑖 äîêàæåì, ÷òî âñå 𝑥𝑖  öåëûå ÷èñëà è

𝑗(𝑗 + 1)
𝑥1 + 𝑥2 + . . . + 𝑥𝑖 =
2
äëÿ íåêîòîðîãî 𝑗 ∈ {0, 1, . . . , 𝑖}.
32 Solutions. Республиканская олимпиада 2021 года. 9 класс

База. 𝑖 = 1. Èç óñëîâèÿ ïîëó÷àåì, ÷òî 𝑥1 ∈ {0, 1}.

Предположение. Ïóñòü óòâåðæäåíèå âåðíî äëÿ 𝑖.
Переход. Äîêàæåì äëÿ 𝑖 + 1. Ïî óñëîâèþ
2
𝑥1 3 + . . . + 𝑥𝑖+1 3 = (𝑥1 + . . . + 𝑥𝑖+1 ) =
2
= (𝑥1 + . . . + 𝑥𝑖 ) + 𝑥𝑖+1 (𝑥𝑖+1 + 2(𝑥1 + . . . + 𝑥𝑖 )) =⇒
=⇒ 𝑥𝑖+1 3 = 𝑥𝑖+1 (𝑥𝑖+1 + 2(𝑥1 + . . . + 𝑥𝑖 )) = 𝑥𝑖+1 (𝑥𝑖+1 + 𝑗(𝑗 + 1)). (1)
Åñëè 𝑥𝑖+1 = 0, òî ïåðåõîä äîêàçàí. Ïóñòü òåïåðü 𝑥𝑖+1 ̸= 0. Òîãäà èç (1)
ïîëó÷èì, ÷òî 𝑥𝑖+1 2 − 𝑥𝑖+1 − 𝑗(𝑗 + 1) = 0, îòêóäà 𝑥𝑖+1 = 𝑗 + 1 èëè 𝑥𝑖+1 = −𝑗 .
(𝑗 − 1)𝑗
Çíà÷èò 𝑥𝑖+1  öåëîå, è 𝑥1 + . . . + 𝑥𝑖+1 ðàâåí îäíîìó èç ÷èñåë ,
2
𝑗(𝑗 + 1) (𝑗 + 1)(𝑗 + 2) (𝑗 − 1)𝑗 𝑗(𝑗 + 1)
, è = ïðè 𝑗 = 0. Ïåðåõîä äîêàçàí.
2 2 2 2
Ïóñòü 𝑓 (𝑖, 𝑗)  êîëè÷åñòâî õîðîøèõ ïîñëåäîâàòåëüíîñòåé äëèíû 𝑖 òàêèå,
𝑗(𝑗 + 1)
÷òî 𝑥1 + . . . + 𝑥𝑖 = , ãäå 0 ≤ 𝑗 ≤ 𝑖. Òîãäà
2
𝑔(𝑛) = 𝑓 (𝑛, 0) + 𝑓 (𝑛, 1) + . . . + 𝑓 (𝑛, 𝑛).
Ïîíÿòíî, ÷òî 𝑓 (1, 0) = 𝑓 (1, 1) = 1. Ðàññìîòðèì ñîñòîÿíèå 𝑓 (𝑖, 𝑗). Ïî äîêà-
çàííîìó âûøå 𝑥𝑖+1 ðàâåí îäíîìó èç ÷èñåë 0, 𝑗 + 1 èëè −𝑗 .
Åñëè 𝑥𝑖+1 = 0, òî ìû ïîëó÷èì ñîñòîÿíèå 𝑓 (𝑖 + 1, 𝑗).
Åñëè 𝑥𝑖+1 = 𝑗 + 1, òî ìû ïîëó÷èì ñîñòîÿíèå 𝑓 (𝑖 + 1, 𝑗 + 1).
Ïóñòü òåïåðü 𝑥𝑖+1 = −𝑗 (𝑗 > 0, òàê êàê ìû ðàññìîòðåëè ñëó÷àè 𝑥𝑖+1 =
0). Òîãäà ìû ïîëó÷èì ñîñòîÿíèå 𝑓 (𝑖 + 1, 𝑗 − 1).  èòîãå ìû ïîëó÷èì ñëåäó-
þùèå ðåêóððåíòíûå ñîîòíîøåíèå:
𝑓 (𝑖 + 1, 0) = 𝑓 (𝑖, 0) + 𝑓 (𝑖, 1), 𝑓 (𝑖 + 1, 𝑗) = 𝑓 (𝑖, 𝑗 − 1) + 𝑓 (𝑖, 𝑗) + 𝑓 (𝑖, 𝑗 + 1)
äëÿ âñåõ 1 ≤ 𝑗 < 𝑖,
𝑓 (𝑖 + 1, 𝑖) = 𝑓 (𝑖, 𝑖 − 1) + 𝑓 (𝑖, 𝑖), 𝑓 (𝑖 + 1, 𝑖 + 1) = 𝑓 (𝑖, 𝑖).
Èíäóêöèåé ïî 𝑘 äîêàæåì, ÷òî 𝑓 (𝑘, 0) ≥ 2𝑘−1 è 𝑔(𝑘) ≤ 2𝑘−1 + 3𝑘−1 .
Áàçà: 𝑘 = 1. 𝑓 (0, 0) = 1, 𝑔(1) = 2 âñå âåðíî.
Ïðåäïîëîæèì, ÷òî óòâåðæäåíèå âåðíî äëÿ 𝑘 . Äîêàæåì äëÿ 𝑘 + 1. Çà-
ìåòèì, ÷òî
𝑓 (1, 0) = 𝑓 (1, 1) è 𝑓 (𝑖 + 1, 1) = 𝑓 (𝑖 + 1, 0) + 𝑓 (𝑖, 2) ≥ 𝑓 (𝑖 + 1, 0).
Çíà÷èò 𝑓 (𝑘, 1) ≥ 𝑓 (𝑘, 0) ≥ 2𝑘−1 , ñëåäîâàòåëüíî, 𝑓 (𝑘 + 1, 0) = 𝑓 (𝑘, 0) +
𝑓 (𝑘, 1) ≥ 2𝑘 . Òàêæå
𝑔(𝑘 +1) = 𝑓 (𝑘 +1, 0)+. . .+𝑓 (𝑘 +1, 𝑘 +1) = 3(𝑓 (𝑘, 0)+. . .+𝑓 (𝑘, 𝑘))−𝑓 (𝑘, 0) =
= 3𝑔(𝑘) − 𝑓 (𝑘, 0) ≤ 3(2𝑘−1 + 3𝑘−1 ) − 2𝑘−1 = 2𝑘 + 3𝑘 ,
÷òî è òðåáîâàëîñü äîêàçàòü.
Solutions. Республиканская олимпиада 2021 года. 10 класс 33

Республиканская олимпиада 2021 года. 10 класс

№1. Ìîæíî ëè ðàçðåçàòü êëåò÷àòûé êâàäðàò 100 × 100 íà ðàâíîå êîëè-

÷åñòâî ïðÿìîóãîëüíèêîâ 2 × 4 è 1 × 8? (Ôèãóðêè ìîæíî ïîâîðà÷èâàòü è
ïåðåâîðà÷èâàòü.) (Golovanov A.)

Ответ. Íåò.

Решение. Ïðåäïîëîæèì, èñêîìîå ðàçðåçàíèå ñóùåñòâóåò. Ïëîùàäü êàæ-

äîãî ïðÿìîóãîëüíèêà ðàâíà 8, ïîýòîìó îáùåå êîëè÷åñòâî ïðÿìîóãîëüíèêîâ
â ðàçðåçàíèè ðàâíî 1250, òî åñòü ïðÿìîóãîëüíèêîâ êàæäîãî âèäà 625.
Çàíóìåðóåì â êâàäðàòå ñòðîêè (ñâåðõó âíèç) è ñòîëáöû (ñëåâà íàïðàâî)
÷èñëàìè îò 1 äî 100, à çàòåì ïîñòàâèì â êàæäóþ êëåòêó ñóììó íîìåðîâ
ñòðîêè è ñòîëáöà, íà ïåðåñå÷åíèè êîòîðûõ îíà íàõîäèòñÿ. Ïðè ýòîì, åñëè â
êëåòêå îêàçàëîñü ÷èñëî 𝑘 , òî â êëåòêàõ, ïðèìûêàþùèõ ê íåé ñïðàâà è ñíè-
çó, áóäåò ñòîÿòü ÷èñëî 𝑘 + 1. Ïîýòîìó ñóììà âñåõ ÷èñåë â ïðÿìîóãîëüíèêå
1 × 8  ÿâëÿåòñÿ ñóììîé âîñüìè ïîñëåäîâàòåëüíûõ ÷èñåë è, ñëåäîâàòåëüíî,
äà¼ò îñòàòîê 4 ïðè äåëåíèè íà 8. Ñóììà ÷èñåë â 625 òàêèõ ïðÿìîóãîëüíèêàõ
òîæå äà¼ò òàêîé îñòàòîê ïðè äåëåíèè íà 8. Ñóììà âñåõ ÷èñåë â ïðÿìîóãîëü-
íèêå 2 × 4 ðàâíà
𝑘 + 2(𝑘 + 1) + 2(𝑘 + 2) + 2(𝑘 + 3) + (𝑘 + 4) = 8𝑘 + 16,
ãäå 𝑘  ÷èñëî â ëåâîì âåðõíåì óãëó, òî åñòü äåëèòñÿ íà 8. Òàêèì îáðàçîì,
åñëè èñêîìîå ðàçðåçàíèå ñóùåñòâóåò, ñóììà âñåõ ÷èñåë â êâàäðàòå 100×100
äîëæíà äàâàòü îñòàòîê 4 ïðè äåëåíèè íà 8. Ñ äðóãîé ñòîðîíû, ýòà ñóììà
ðàâíà 2 × 100 × (1 + 2 + · · · + 100), òî åñòü êðàòíà 8  ïðîòèâîðå÷èå.
№2. Äàí òðåóãîëüíèê 𝐴𝐵𝐶 , â êîòîðîì 𝐴𝐵 +𝐴𝐶 > 3𝐵𝐶 . Âíóòðè ýòîãî òðå-
óãîëüíèêà îòìå÷åíû òî÷êè 𝑃 è 𝑄 òàêèå, ÷òî ∠𝐴𝐵𝑃 = ∠𝑃 𝐵𝑄 = ∠𝑄𝐵𝐶 è
∠𝐴𝐶𝑄 = ∠𝑄𝐶𝑃 = ∠𝑃 𝐶𝐵 . Äîêàæèòå, ÷òî 𝐴𝑃 +𝐴𝑄 > 2𝐵𝐶 . (Satylkhanov K.)

Решение. Ïóñòü 𝐼  öåíòð âïèñàííîé îêðóæíîñòè òðåóãîëüíèêà 𝐴𝐵𝐶 .

Òàê êàê 𝑃 è 𝑄 èçîãîíàëüíî ñîïðÿæåííûå òî÷êè â òðåóãîëüíèêå 𝐴𝐵𝐶 , òî
∠𝐵𝐴𝑃 = ∠𝐶𝐴𝑄. Îáîçíà÷èì ∠𝑃 𝐴𝐼 = 𝛼, ∠𝐴𝐵𝑃 = 𝛽, ∠𝐴𝐶𝑄 = 𝛾 .
1
Èç óñëîâèÿ ñëåäóåò, ÷òî 𝛽, 𝛾 < 60∘ , îòêóäà cos 𝛽, cos 𝛾 > . Èñïîëüçóÿ
2
òåîðåìó ñèíóñîâ äëÿ òðåóãîëüíèêîâ 𝑃 𝐵𝑄 è 𝑃 𝐶𝑄 ïîëó÷àåì, ÷òî
𝑃 𝐶 𝑄𝐵 sin 2𝛽 sin 2𝛾
· = · = 4 cos 𝛽 cos 𝛾 > 1. (1)
𝑃 𝐵 𝑄𝐶 sin 𝛾 sin 𝛽
Ïóñòü ïðÿìûå 𝐴𝐼, 𝐵𝐼, 𝐶𝐼 ïåðåñåêàþò 𝑃 𝑄 â òî÷êàõ 𝐿, 𝐷, 𝐸 ñîîòâåò-
ñòâåííî. Èñïîëüçóÿ (1) è ñâîéñòâó áèññåêòðèñû ïîëó÷èì, ÷òî
𝑃𝐷 𝑃𝐵 𝑃𝐶 𝑃𝐸
= < = ,
𝐷𝑄 𝐵𝑄 𝐶𝑄 𝐸𝑄
34 Solutions. Республиканская олимпиада 2021 года. 10 класс

çíà÷èò òî÷êà 𝐼 ëåæèò âíóòðè òðåóãîëüíèêà 𝐴𝑃 𝑄. Òîãäà èñïîëüçóÿ ôîð-

ìóëó áèññåêòðèñû èìååì, ÷òî
4𝐴𝑃 · 𝐴𝑄 4𝐴𝑃 · 𝐴𝑄
2𝐴𝐼 < 2𝐴𝐿 = · cos 𝛼 < ≤ 𝐴𝑃 + 𝐴𝑄. (2)
𝐴𝑃 + 𝐴𝑄 𝐴𝑃 + 𝐴𝑄
Ïóñòü 𝐾 îñíîâàíèå ïåðïåíäèêóëÿðà èç 𝐼 íà 𝐴𝐶 . Òîãäà
𝐴𝐵 + 𝐴𝐶 − 𝐵𝐶
𝐴𝐼 > 𝐴𝐾 = > 𝐵𝐶. (3)
2
Èç (2) è (3) ñëåäóåò óòâåðæäåíèå çàäà÷è.
A
A

K
K
II
P
P
D E Q
L E
D L Q

B
B C
C

№3. Ïîñëåäîâàòåëüíîñòè
√ (𝑎𝑛 ) è (𝑏𝑛 ) çàäàíû óñëîâèÿìè 𝑎1 = 𝑏1 = 1, 𝑎𝑛+1 =
√
𝑎𝑛 + 𝑎𝑛 , 𝑏𝑛+1 = 𝑏𝑛 + 3 𝑏𝑛 ïðè âñåõ íàòóðàëüíûõ 𝑛. Äîêàæèòå, ÷òî ñóùå-
ñòâóåò íàòóðàëüíîå ÷èñëî 𝑛, äëÿ êîòîðîãî íåðàâåíñòâî 𝑎𝑛 ≤ 𝑏𝑘 < 𝑎𝑛+1
âûïîëíåíî ðîâíî ïðè 2021 çíà÷åíèÿõ 𝑘 . (Golovanov A.)

Решение. Ïîñëåäîâàòåëüíîñòè (𝑎𝑛 ) è (𝑏𝑛 ) çàäàþò ðàçáèåíèå ëó÷à [1; +∞)

íà ïîëóèíòåðâàëû [𝑎𝑛 ; 𝑎𝑛+1 ) (êîòîðûå ìû áóäåì íàçûâàòü большими) è
ðàçáèåíèå ýòîãî æå ëó÷à íà ïîëóèíòåðâàëû [𝑏𝑘 ; 𝑏𝑘+1 ) (êîòîðûå ìû áóäåì
íàçûâàòü маленькими). Åñëè äëèíà áîëüøîãî ïîëóèíòåðâàëà çàêëþ÷åíà
ìåæäó ÷èñëàìè 𝑚 è 𝑀 > 𝑚, à äëèíû âñåõ ïîêðûâàþùèõ åãî ìàëåíüêèõ
ïîëóèíòåðâàëîâ  ìåæäó 𝑑 è 𝐷 > 𝑑, òî êîëè÷åñòâî êîíöîâ ìàëåíüêèõ ïî-
ëóèíòåðâàëîâ, ëåæàùèõ íà ëþáîì èç áîëüøèõ, çàêëþ÷åíî ìåæäó 𝑚 𝐷 −1 è
𝑀
𝑑 + 1 . Äåéñòâèòåëüíî, ïóñòü ýòî êîëè÷åñòâî ðàâíî 𝑠. Òîãäà îíè îãðàíè-
÷èâàþò 𝑠 − 1 (ïîñëåäîâàòåëüíûõ) ìàëåíüêèõ ïîëóèíòåðâàëîâ, ñóììàðíàÿ
äëèíà êîòîðûõ íå ïðåâîñõîäèò 𝑀 (ïîñêîëüêó âñå ýòè ìàëåíüêèå ïîëóèí-
òåðâàëû ñîäåðæàòñÿ â áîëüøîì), à ñ äðóãîé ñòîðîíû, íå ìåíüøå (𝑠 − 1)𝑑,
Solutions. Республиканская олимпиада 2021 года. 10 класс 35

îòêóäà 𝑠 − 1 ≤ 𝑀 𝑑 . Àíàëîãè÷íî, äîáàâëÿÿ ê ýòèì ïîëóèíòåðâàëàì åù¼ äâà

 îäèí ïåðåä ïåðâûì, äðóãîé ïîñëå ïîñëåäíåãî, ïîëó÷àåì 𝑠 + 1 ìàëåíüêèõ
ïîëóèíòåðâàëîâ (ñóììàðíîé äëèíîé íå áîëåå (𝑠+1)𝐷), êîòîðûå ïîêðûâàþò
áîëüøîé ïîëóèíòåðâàë (äëèíà êîòîðîãî íå ìåíüøå 𝑚), îòêóäà 𝑠 + 1 ≥ 𝑚 𝐷.
Ðàññìîòðèì íàèìåíüøåå 𝑛, äëÿ êîòîðîãî 𝑎𝑛 ≥ 2021, 26 . Ëåãêî âèäåòü,
÷òî 𝑎𝑛 < 𝑎𝑛+1 < 𝑎𝑛+2 < 2021, 256 . Äåéñòâèòåëüíî, åñëè 𝑎𝑘 < 20226 , òî
𝑎𝑘+1 − 𝑎𝑘 < 20223 . Ïîñêîëüêó 𝑎𝑛−1 < 2021, 26 , äîñòàòî÷íî ïðîâåðèòü,
÷òî 2021, 256 − 2021, 26 > 3 · 20223 . Íî 2021, 256 − 2021, 26 = (2021, 25 −
2021, 2)(2021, 255 + · · · + 2021, 25 ) > 0, 05 · 6 · 2021, 25 > 3 · 20223 . Äëÿ êàæäîãî
𝑏𝑘 , ëåæàùåãî ìåæäó 𝑎𝑛 è 𝑎𝑛+1 , 2021, 22 < 𝑏𝑘+1 − 𝑏𝑘 < 2021, 252 . Ïîýòîìó
è íà ïîëóèíòåðâàëå [𝑎𝑛 ; 𝑎𝑛+1 ), è íà ïîëóèíòåðâàëå [𝑎𝑛+1 ; 𝑎𝑛+2 ) êîëè÷åñòâî
2021,23
÷ëåíîâ ïîñëåäîâàòåëüíîñòè 𝑏𝑘 çàêëþ÷åíî ìåæäó 2021,25 2 − 1 > 2020, 05 è

2021,253
2021,22 + 1 < 2022, 4 (çäåñü ìû ïîëüçóåìñÿ òåì, ÷òî ïðè 𝑝 > 1000 èìåþò
3 3
ìåñòî íåðàâåíñòâà (𝑝+0,05)
𝑝2 < 𝑝 + 0, 2 è (𝑝−0,05)
𝑝2 > 𝑝 − 0, 2). Ñëåäîâàòåëüíî,
íà êàæäîì èç ýòèõ ïîëóèíòåðâàëîâ ëåæèò 2021 èëè 2022 ÷ëåíà ïîñëåäîâà-
òåëüíîñòè (𝑏𝑘 ).
Ñ äðóãîé ñòîðîíû, íà ïîëóèíòåðâàëå [𝑎𝑛 ; 𝑎𝑛+2 ) êîëè÷åñòâî ÷ëåíîâ ïî-
2021,23 2021,253
ñëåäîâàòåëüíîñòè (𝑏𝑘 ) çàêëþ÷åíî ìåæäó 2· 2021,25 2 −1 > 4041, 1 è 2· 2021,22 +

1 < 4043, 8. Ïîýòîìó ýòî êîëè÷åñòâî íå ìîæåò áûòü ðàâíî 4044, è õîòÿ áû
íà îäíîì èç äâóõ áîëüøèõ ïîëóèíòåðâàëîâ [𝑎𝑛 ; 𝑎𝑛+1 ) è [𝑎𝑛+1 ; 𝑎𝑛+2 ) êîëè-
÷åñòâî ÷ëåíîâ ïîñëåäîâàòåëüíîñòè (𝑏𝑘 ) ðàâíî 2021.
№4. Íà ñòîðîíå 𝐴𝐶 òðåóãîëüíèêà 𝐴𝐵𝐶 íàøëàñü òàêàÿ òî÷êà 𝐷 , ÷òî 𝐵𝐶 =
𝐷𝐶 . Ïóñòü 𝐽  öåíòð âïèñàííîé îêðóæíîñòè òðåóãîëüíèêà 𝐴𝐵𝐷. Äîêà-
æèòå, ÷òî îäíà èç êàñàòåëüíûõ èç òî÷êè 𝐽 êî âïèñàííîé îêðóæíîñòè òðå-
óãîëüíèêà 𝐴𝐵𝐶 ïàðàëëåëüíà ïðÿìîé 𝐵𝐷. (Kungozhin M.)

C
C

D
D
II
JJ
F
F
A
A KE
K E B
B

Решение. Ïóñòü 𝐼  öåíòð âïèñàííîé îêðóæíîñòè òðåóãîëüíèêà 𝐴𝐵𝐶 .

Äëÿ íà÷àëà ïîêàæåì, ÷òî 𝐼𝐽 = 𝐼𝐵 . Ïóñòü ∠𝐼𝐴𝐵 = 𝛼, ∠𝐴𝐵𝐷 = 𝛽 . Çàìåòèì,
36 Solutions. Республиканская олимпиада 2021 года. 10 класс

÷òî òî÷êè 𝐼, 𝐽, 𝐴 ëåæàò íà áèññåêòðèñå óãëà 𝐴. ∠𝐼𝐽𝐵 = ∠𝐽𝐵𝐴 + ∠𝐽𝐴𝐵 =

𝛽 ∠𝐴𝐵𝐶
𝛼 + è ∠𝐶𝐵𝐷 = ∠𝐶𝐷𝐵 = 𝛽 + 2𝛼. Òàê êàê ∠𝐶𝐵𝐼 = ∠𝐴𝐵𝐼 = =
2 2
𝛼 + 𝛽 , òî ∠𝐷𝐵𝐼 = 𝛼. Çíà÷èò

∠𝐴𝐵𝐷 𝛽
∠𝐼𝐵𝐽 = ∠𝐷𝐵𝐼 + ∠𝐷𝐵𝐽 = ∠𝐷𝐵𝐼 + = 𝛼 + = ∠𝐼𝐽𝐵,
2 2
îòêóäà 𝐼𝐵 = 𝐼𝐽 . Ïóñòü 𝐾 ∈ 𝐴𝐵 òàêàÿ òî÷êà, ÷òî 𝐽𝐾 ‖ 𝐵𝐷. Òîãäà

∠𝐾𝐽𝐵 = ∠𝐴𝐾𝐽 − ∠𝐾𝐵𝐽 = ∠𝐴𝐵𝐷 − ∠𝐾𝐵𝐽 = ∠𝐾𝐵𝐽,

ïîýòîìó 𝐽𝐾 = 𝐵𝐾 . Çíà÷èò △𝐼𝐾𝐽 = △𝐼𝐾𝐵 , ñëåäîâàòåëüíî ∠𝐼𝐾𝐽 =

∠𝐼𝐾𝐵 . Ïóñòü âïèñàííàÿ îêðóæíîñòü òðåóãîëüíèêà 𝐴𝐵𝐶 êàñàåòñÿ 𝐴𝐵 â
òî÷êå 𝐸 , à 𝐹 òàêàÿ òî÷êà íà îòðåçêå 𝐽𝐾 , ÷òî 𝐾𝐸 = 𝐾𝐹 . Òîãäà △𝐼𝐾𝐸 =
△𝐼𝐾𝐹 , ïîýòîìó 𝐼𝐸 = 𝐼𝐹 è ∠𝐼𝐹 𝐾 = ∠𝐼𝐸𝐾 = 90∘ . Çíà÷èò 𝐾𝐽 êàñàåòñÿ
âïèñàííîé îêðóæíîñòè òðåóãîëüíèêà 𝐴𝐵𝐶 â òî÷êå 𝐹 è 𝐽𝐹 ‖ 𝐵𝐷, ÷òî è
òðåáîâàëîñü äîêàçàòü.
№5. Íàéäèòå âñå ôóíêöèè 𝑓 : 𝑅+ → 𝑅+ òàêèå, ÷òî
2
𝑓 (𝑥) = 𝑓 (𝑥𝑦) + 𝑓 (𝑥 + 𝑓 (𝑦)) − 1

äëÿ ëþáûõ 𝑥, 𝑦 ∈ 𝑅+ . (Çäåñü 𝑅+  ìíîæåñòâî ïîëîæèòåëüíûõ äåéñòâè-

òåëüíûõ ÷èñåë.) (Satylkhanov K.)

Ответ. 𝑓 (𝑥) = 1 äëÿ ëþáîãî 𝑥 > 0.

Решение. Îáîçíà÷èì äàííîå ðàâåíñòâî ÷åðåç 𝑃 (𝑥, 𝑦), è ïóñòü 𝑓 (1) = 𝑐.

Òîãäà
𝑃 (1, 𝑥) : 𝑓 (𝑥) + 𝑓 (𝑓 (𝑥) + 1) = 𝑐2 + 1. (1)
𝑃 (𝑥, 1) : 𝑓 (𝑥 + 𝑐) = 𝑓 (𝑥)2 − 𝑓 (𝑥) + 1. (2)
Èç (1) ñëåäóåò, ÷òî

𝑓 (𝑥) < 𝑐2 + 1, äëÿ ëþáîãî 𝑥 > 0. (3)

Ïðåäïîëîæèì, ÷òî ñóùåñòâóåò ÷èñëî 𝑡 > 0 òàêîå, ÷òî 𝑓 (𝑡) > 1. Ðàññìîòðèì
ïîñëåäîâàòåëüíîñòü: 𝑎0 = 𝑓 (𝑡) > 1 è 𝑎𝑛+1 = 𝑎2𝑛 − 𝑎𝑛 + 1 ïðè âñåõ 𝑛 ≥ 0. Èç
(2) ñëåäóåò, ÷òî 𝑎𝑛 = 𝑓 (𝑡+𝑐𝑛) äëÿ ëþáîãî 𝑛 ≥ 0. Èíäóêöèåé ëåãêî äîêàçàòü,
2
÷òî 𝑎𝑛 > 1 è 𝑎𝑛+1 − 𝑎𝑛 = (𝑎𝑛 − 1) > 0 äëÿ ëþáîãî 𝑛 ≥ 0. Èñïîëüçóÿ (3)
ïîëó÷àåì, ÷òî

𝑐2 > 𝑓 (𝑡 + 𝑐𝑛) − 1 = 𝑎𝑛 − 1 = 𝑎𝑛−1 (𝑎𝑛−1 − 1) = 𝑎𝑛−1 𝑎𝑛−2 (𝑎𝑛−2 − 1) = . . .

Solutions. Республиканская олимпиада 2021 года. 10 класс 37

. . . = 𝑎𝑛−1 𝑎𝑛−2 . . . 𝑎0 (𝑎0 − 1) > 𝑎0 𝑛 (𝑎0 − 1)

äëÿ ëþáîãî íàòóðàëüíîãî 𝑛, ÷òî íåâîçìîæíî, òàê êàê 𝑎0 > 1 è 𝑎𝑛0 → ∞ ïðè
𝑛 → ∞. Çíà÷èò 𝑓 (𝑥) ≤ 1 äëÿ ëþáîãî 𝑥 > 0.
Ïðåäïîëîæèì, ÷òî ñóùåñòâóåò ÷èñëî 𝑡 > 0 òàêîå, ÷òî 𝑧 = 𝑓 (𝑡) < 1. Àíà-
ëîãè÷íî ðàññìîòðèì ïîñëåäîâàòåëüíîñòü: 𝑎0 = 𝑓 (𝑡) < 1 è 𝑎𝑛+1 = 𝑎𝑛 2 −𝑎𝑛 +1
ïðè âñåõ 𝑛 ≥ 0. Èíäóêöèåé ëåãêî äîêàçàòü, ÷òî 𝑎𝑛 < 1 è 𝑎𝑛+1 − 𝑎𝑛 =
2
(𝑎𝑛 − 1) > 0 äëÿ ëþáîãî 𝑛 ≥ 0. Ïî òåîðåìå Âåéåðøòðàññà ïîñëåäîâàòåëü-
íîñòü 𝑎𝑛 èìååò ïðåäåë. Ïóñòü 𝐴  èñêîìûé ïðåäåë. Òîãäà

𝐴 = lim 𝑎𝑛+1 = lim (𝑎𝑛 2 − 𝑎𝑛 + 1) = 𝐴2 − 𝐴 + 1,

𝑛→∞ 𝑛→∞
(︂ )︂
1
ñëåäîâàòåëüíî 𝐴 = 1. Ïóñòü 𝑞 ∈ 1,  ïðîèçâîëüíîå äåéñòâèòåëüíîå
𝑧
÷èñëî. Èíäóêöèåé ïî 𝑛 äîêàæåì, ÷òî äëÿ ëþáîãî öåëîãî 𝑛 ≥ 0 ñóùåñòâóåò
𝑧
÷èñëî 𝑢 > 0 òàêîå, ÷òî 𝑓 (𝑢) ≤ 𝑛 .
𝑞
База. Äëÿ 𝑛 = 0 ïîäõîäèò 𝑢 = 𝑡.
Предположение. Ïóñòü óòâåðæäåíèå âåðíî äëÿ 𝑛.
𝑧 𝑧2
Переход. Äîêàæåì äëÿ 𝑛 + 1. Îáîçíà÷èì 𝜀 = 𝑛+1 − 2𝑛 .
𝑞 𝑞
𝑧(1 − 𝑞𝑧)
Åñëè 𝑛 = 0, òî 𝜀 = > 0, à åñëè 𝑛 > 0, òî 𝜀 > 0, òàê êàê 𝑧 > 𝑧 2
𝑞
è 𝑞 2𝑛 ≥ 𝑞 𝑛+1 . Çíà÷èò 𝜀 > 0. Ïóñòü 𝑦 > 0 òàêîå ÷èñëî, ÷òî 𝑓 (𝑢𝑦) > 1 − 𝜀
(òàêîå ÷èñëî ñóùåñòâóåò, ïîòîìó ÷òî lim𝑛→∞ 𝑓 (𝑡 + 𝑐𝑛) = 1). Òîãäà

2 𝑧2 𝑧
𝑃 (𝑢, 𝑦) : 𝑓 (𝑢 + 𝑓 (𝑦)) = 1 + 𝑓 (𝑢) − 𝑓 (𝑢𝑦) < + 𝜀 = 𝑛+1 .
𝑞 2𝑛 𝑞

Ïåðåõîä äîêàçàí.
Ñëåäîâàòåëüíî, ôóíêöèÿ 𝑓 ìîæåò ïðèíèìàòü ñêîëü óãîäíî áåñêîíå÷íî
ìàëûå çíà÷åíèÿ, ÷òî íåâîçìîæíî, òàê êàê èç (1) ñëåäóåò, ÷òî 𝑓 (𝑥) = 𝑐2 +
1 − 𝑓 (𝑓 (𝑥) + 1) ≥ 𝑐2 , ïðîòèâîðå÷èå. Çíà÷èò, 𝑓 (𝑥) = 1 äëÿ ëþáîãî 𝑥 > 0, ÷òî
ëåãêî ïðîâåðèòü óäîâëåòâîðÿåò óñëîâèþ çàäà÷è.
№6. Ïóñòü 𝑎  íàòóðàëüíîå ÷èñëî. Äîêàæèòå, ÷òî äëÿ ëþáîãî ðåøåíèÿ
(𝑥, 𝑦) óðàâíåíèÿ
𝑥(𝑦 2 − 2𝑥2 ) + 𝑥 + 𝑦 + 𝑎 = 0
√
â öåëûõ ÷èñëàõ âûïîëíÿåòñÿ íåðàâåíñòâî: |𝑥| ≤ 𝑎 + 2𝑎2 + 2. (Osipov N.)

Решение. Åñëè 𝑥 = 0 èëè äàííîå óðàâíåíèå íå èìååò öåëî÷èñëåííîãî

ðåøåíèÿ, òî çàäà÷à ðåøåíà. Ïóñòü òåïåðü íàîáîðîò. Îáîçíà÷èì 𝐴 = 𝑎 +
38 Solutions. Республиканская олимпиада 2021 года. 10 класс

√
2𝑎2 + 2 > 2𝑎. Ïî óñëîâèþ èìååì, ÷òî 𝑦 + 𝑎 = 𝑘𝑥 äëÿ íåêîòîðîãî öåëîãî
𝑘 . Ïîäñòàâèâ â óñëîâèå ðàâåíñòâî 𝑦 = 𝑘𝑥 − 𝑎 ïîëó÷èì

𝑥2 (𝑘 2 − 2) − 2𝑎𝑘𝑥 + 𝑎2 + 𝑘 + 1 = 0. (*)

1) 𝑘 = 1. Òîãäà (𝑥 + 𝑎)2 = 2𝑎2 + 2, îòêóäà |𝑥| ≤ 𝐴.

2) 𝑘 = 0.  ýòîì ñëó÷àå 2𝑥2 = 𝑎2 + 1, îòêóäà |𝑥| < 𝐴.
3) 𝑘 = −1.  ýòîì ñëó÷àå (𝑥 − 𝑎)2 = 2𝑎2 , ÷òî íåâåðíî (ñòåïåíü âõîæäåíèå 2
â ïðàâîé ÷àñòè íå÷åòíî).
4) 𝑘 ≥ 2. Èç (*) ñëåäóåò, ÷òî 𝑥 > 0. Ïðåäïîëîæèì, ÷òî 𝑥 > 𝐴. Òîãäà èç (3)
√ 𝑎
2𝑥2 = (𝑘𝑥 − 𝑎)2 + 𝑘 + 1 > (2𝑥 − 𝑎)2 =⇒ 2𝑥 > 2𝑥 − 𝑎 =⇒ 𝑥 < √ < 2𝑎,
2− 2
ïðîòèâîðå÷èå.
5) 𝑘 ≤ −2. Èç (*) ñëåäóåò, ÷òî 𝑥 < 0. Ïóñòü 𝑧 = −𝑥 > 0, 𝑚 = −𝑘 ≥ 2.
Ïðåäïîëîæèì, ÷òî 𝑧 > 𝐴. Èç (*) ïîëó÷èì, ÷òî

2𝑧 2 − 𝑎2 − 1 = 𝑚(𝑚𝑧 2 − 2𝑎𝑧 − 1) ≥ 4𝑧 2 − 4𝑎𝑧 − 2 =⇒ 2(𝑧 − 𝑎)2 ≤ 𝑎2 + 1,

ïðîòèâîðå÷èå.
Solutions. Республиканская олимпиада 2021 года. 11 класс 39

Республиканская олимпиада 2021 года. 11 класс

№1. Íà ïîëêå ñòîÿò â áåñïîðÿäêå 100 òîìîâ ýíöèêëîïåäèè, çàíóìåðîâàí-

íûõ âñåìè íàòóðàëüíûìè ÷èñëàìè îò 1 äî 100. Çà îäíó îïåðàöèþ ìîæíî
âçÿòü è ëþáûì ñïîñîáîì ïåðåñòàâèòü íà ñâîèõ ìåñòàõ ëþáûå òðè òîìà
(ò.å. åñëè ýòè òîìà ñòîÿëè â ìåñòàõ 𝑎, 𝑏, 𝑐, òî ïîñëå ýòîé îïåðàöèè ýòè òî-
ìà òàêæå áóäóò ñòîÿòü â ìåñòàõ 𝑎, 𝑏, 𝑐, íî âîçìîæíî â äðóãîì ïîðÿäêå).
Ïðè êàêîì íàèìåíüøåì 𝑚 ìîæíî óòâåðæäàòü, ÷òî 𝑚 òàêèìè îïåðàöèÿìè
óäàñòñÿ ðàññòàâèòü âñå òîìà ïî ïîðÿäêó, êàê áû îíè íè áûëè ðàññòàâëåíû
ïåðâîíà÷àëüíî? (Òîìà ñòîÿò ïî ïîðÿäêó, åñëè 1-é òîì ñòîèò íà 1-ì ìåñòå,
2-é òîì íà 2-ì, ..., 100-é òîì íà 100-ì ìåñòå.) (Golovanov A.)

Решение. Ñì. ðåøåíèå çàäà÷è 9.2.

№2. Äîêàæèòå, ÷òî ñóùåñòâóåò áåñêîíå÷íî ìíîãî ïàð (𝑎, 𝑏) íàòóðàëüíûõ
÷èñåë òàêèõ, ÷òî 𝑎 ̸= 𝑏 è äëÿ ëþáîãî íàòóðàëüíîãî 𝑛 âûïîëíÿåòñÿ ðàâåíñòâî
[︁√ √︀ ]︁ [︁√︀ ]︁
𝑎2 𝑛 + 𝑏2 𝑛 + 1 = (𝑎 + 𝑏)2 𝑛 + 3 .

(Çäåñü [𝑥]  öåëàÿ ÷àñòü ÷èñëà 𝑥, òî åñòü íàèáîëüøåå öåëîå ÷èñëî, íå ïðå-
âîñõîäÿùåå 𝑥.) (Abdykulov A.)

Решение. Äîêàæåì, ÷òî ïîäõîäÿò âñå ïàðû âèäà (2𝑘, 𝑘), ãäå 𝑘  íàòó-
ðàëüíîå ÷èñëî. Äåéñòâèòåëüíî, ïóñòü 𝑛  ïðîèçâîëüíîå íàòóðàëüíîå ÷èñëî.
Îáîçíà÷èì
√ √︀ √︁
2
𝑥 = 𝑎2 𝑛 + 𝑏2 𝑛 + 1, 𝑦 = (𝑎 + 𝑏) 𝑛 + 3, 𝑠 = 𝑘 2 𝑛.
Çàìåòèì, ÷òî
⎛ ⎞
𝑎2 𝑛
(︂ √︁ )︂
2
𝑦 2 − 𝑥2 = 2 𝑎𝑏𝑛 + 1 − (𝑎𝑏𝑛) + 𝑎2 𝑛 = 2 ⎝1 − √︁ ⎠=
2
𝑎𝑏𝑛 + (𝑎𝑏𝑛) + 𝑎2 𝑛
⎛ ⎞
(︂ )︂
2𝑘𝑛 ⎜ 2 ⎟
=2 1− √ ⎝1 −
= 2⎜ √︂ ⎟=
𝑘𝑛 + 𝑘 2 𝑛2 + 𝑛 1⎠
1+ 1+
𝑠
√ √
𝑠+1− 𝑠 2
=2· √ √ = (︀√ √ )︀2 . (1)
𝑠+1+ 𝑠 𝑠+1+ 𝑠
Èç (1) ñëåäóåò, ÷òî
1
0 < 𝑦 2 − 𝑥2 < . (2)
2𝑠
40 Solutions. Республиканская олимпиада 2021 года. 11 класс

√
Òàê êàê 𝑥 + 𝑦 > 6 𝑠, òî èç (2) ïîëó÷èì, ÷òî

𝑦 2 − 𝑥2 1
0<𝑦−𝑥= < √ . (3)
𝑦+𝑥 12𝑠 𝑠

Лемма. Äëÿ ëþáîãî íàòóðàëüíîãî 𝑚 âûïîëíåíî íåðàâåíñòâî

√ 1
{ 9𝑚 + 3} > √ .
4 𝑚

Доказательство. Ïóñòü 𝑣 = 9𝑚 + 3 , îòêóäà 𝑣 2 ≤ 9𝑚 + 3. Òàê êàê

[︀√ ]︀

𝑣 2 ≡ 0, 1, 4, 7 (mod 9), òî 𝑣 2 ≤ 9𝑚 + 1. Òîãäà

√ √ √ √ 2
{ 9𝑚 + 3} = 9𝑚 + 3 − 𝑣 ≥ 9𝑚 + 3 − 9𝑚 + 1 = √ √ >
9𝑚 + 3 + 9𝑚 + 1
1 1
>√ > √ .
9𝑚 + 3 4 𝑚
√ 1
Èñïîëüçóÿ ëåììó è (3) ïîëó÷èì, ÷òî 𝑦 − [𝑦] = {𝑦} = { 9𝑠 + 3} > √ >
4 𝑠
𝑦 − 𝑥, îòêóäà [𝑦] < 𝑥 < 𝑦 . Çíà÷èò [𝑥] = [𝑦], ÷òî è òðåáîâàëîñü äîêàçàòü.
№3. Âíóòðè òðåóãîëüíèêà 𝐴𝐵𝐶 âçÿòà òàêàÿ òî÷êà 𝑀 , ÷òî

max(∠𝑀 𝐴𝐵, ∠𝑀 𝐵𝐶, ∠𝑀 𝐶𝐴) = ∠𝑀 𝐶𝐴.

Äîêàæèòå, ÷òî sin ∠𝑀 𝐴𝐵 + sin ∠𝑀 𝐵𝐶 ≤ 1. (Sedrakyan N.)

Первое решение. Çàìåòèì, ÷òî ñðåäè òð¼õ óãëîâ ∠𝑀 𝐶𝐴, ∠𝑀 𝐴𝐵 ,

∠𝑀 𝐵𝐶 íå ìîæåò áûòü äâóõ íåîñòðûõ (îíè âêëàäûâàþòñÿ â óãëû òðåóãîëü-
íèêà 𝐴𝐵𝐶 ). Çíà÷èò, èññëåäóåìûå äâà óãëà îñòðûå.
1) Çàôèêñèðóåì òî÷êè 𝑀 , 𝐵 , 𝐶 è áóäåì äâèãàòü òî÷êó 𝐴′ ïî îòðåçêó
𝐴𝑀 îò 𝐴 ê 𝑀 . Óãîë ∠𝑀 𝐶𝐴′ áóäåò íåïðåðûâíî óìåíüøàòüñÿ, óãîë ∠𝑀 𝐴′ 𝐵
 íåïðåðûâíî óâåëè÷èâàòüñÿ, óãîë ∠𝑀 𝐵𝐶 íå áóäåò ìåíÿòüñÿ. Ïîñêîëüêó â
ôèíàëüíîì ïîëîæåíèè èìååì ∠𝑀 𝐶𝐴′ = 0 < ∠𝑀 𝐵𝐶 , â íåêîòîðûé ìîìåíò
óãîë ∠𝑀 𝐶𝐴′ ñòàíåò ðàâåí îäíîìó èç óãëîâ ∠𝑀 𝐴′ 𝐵 èëè ∠𝑀 𝐵𝐶 , îñòàâàÿñü
íå ìåíüøå äðóãîãî. Ïî çàìå÷àíèþ â íà÷àëå ðåøåíèÿ, òåïåðü âñå òðè óãëà
îñòðûå. Çíà÷èò, äîñòàòî÷íî äîêàçàòü íåðàâåíñòâî äëÿ íîâîé êîíôèãóðà-
öèè.
Èòàê, ñ÷èòàåì, áåç îãðàíè÷åíèÿ îáùíîñòè, ÷òî ∠𝑀 𝐶𝐴 = ∠𝑀 𝐴𝐵 ≥
∠𝑀 𝐵𝐶 . Òîãäà îêðóæíîñòü 𝐴𝑀 𝐶 êàñàåòñÿ 𝐴𝐵 .
2) Ïóñòü 𝐶𝑀 ïåðåñåêàåò 𝐴𝐵 â òî÷êå 𝐾 . Ïóñòü 𝐵 ′  òî÷êà, ñèììåòðè÷-
íàÿ òî÷êå 𝐴 îòíîñèòåëüíî 𝐾 . Òîãäà 𝐾𝐵 ′2 = 𝐾𝐴2 = 𝐾𝑀 · 𝐾𝐶 , òàê ÷òî
Solutions. Республиканская олимпиада 2021 года. 11 класс 41

îêðóæíîñòü 𝐶𝑀 𝐵 ′ êàñàåòñÿ 𝐴𝐵 . Ïîñêîëüêó 𝐵 íàõîäèòñÿ âíå ýòîé îêðóæ-

íîñòè, ïîëó÷àåì ∠𝑀 𝐵𝐶 ≤ ∠𝑀 𝐵 ′ 𝐶 .
Åñëè ∠𝑀 𝐵 ′ 𝐶 ≥ ∠𝑀 𝐶𝐴, òî íà îòðåçêå 𝐵𝐵 ′ ìîæíî âûáðàòü òî÷êó 𝐵 * òà-
êóþ, ÷òî ∠𝑀 𝐵 * 𝐶 = ∠𝑀 𝐶𝐴 = 𝜙. Ïóñòü 𝑋, 𝑌, 𝑍 îñíîâàíèå ïåðïåíäèêóëÿðà
èç òî÷êè 𝑀 íà ñòîðîíû 𝐴𝐵 * , 𝐵 * 𝐶, 𝐶𝐴. Ïî íåðàâåíñòâó Ýðäåøà-Ìîðäåëëà
𝑀 𝐴 + 𝑀 𝐵 * + 𝑀 𝐶 ≥ 2(𝑀 𝑋 + 𝑀 𝑌 + 𝑀 𝑍) = 2 sin 𝜙(𝑀 𝐴 + 𝑀 𝐵 * + 𝑀 𝐶), ñëå-
äîâàòåëüíî 𝜙 ≤ 𝜋/6, îòêóäà è ñëåäóåò òðåáóåìîå. (Íåðàâåíñòâî Ýðäåøà-
Ìîðäåëëà: äëÿ ïðîèçâîëüíîé òî÷êè 𝑆 âíóòðè òðåóãîëüíèêà, ñóììà ðàñ-
ñòîÿíèè îò 𝑆 äî âåðøèí òðåóãîëüíèêà íå ìåíüøå, ÷åì óäâîåííàÿ ñóììà
ðàññòîÿíèè îò 𝑆 äî ñòîðîí òðåóãîëüíèêà.)
Èíà÷å èìååì ∠𝑀 𝐵 ′ 𝐶 < ∠𝑀 𝐶𝐴, è â òðåóãîëüíèêå 𝐴𝐵 ′ 𝐶 ïî-ïðåæíåìó
âñå óãëû ∠𝑀 𝐶𝐴, ∠𝑀 𝐴𝐵 ′ , ∠𝑀 𝐵 ′ 𝐶 îñòðûå. Ïîýòîìó äîñòàòî÷íî äîêàçàòü
óòâåðæäåíèå äëÿ òî÷êè 𝐵 , çàìåí¼ííîé íà 𝐵 ′ . Òàêèì îáðàçîì, ìû ñâåëè
çàäà÷ó ê ñëó÷àþ, êîãäà 𝐶𝐾  ìåäèàíà òðåóãîëüíèêà 𝐴𝐵𝐶 , à îêðóæíîñòè
𝐶𝑀 𝐴 è 𝐶𝑀 𝐵 êàñàþòñÿ 𝐴𝐵 , òî åñòü ∠𝑀 𝐵𝐴 = ∠𝑀 𝐶𝐵 è ∠𝑀 𝐶𝐴 = ∠𝑀 𝐴𝐵 .
Ïðè ýòîì ∠𝑀 𝐵𝐶 ≤ ∠𝑀 𝐶𝐴, îòêóäà
𝛽 = ∠𝐴𝐵𝐶 = ∠𝑀 𝐵𝐴 + ∠𝑀 𝐵𝐶 ≤ ∠𝑀 𝐶𝐵 + ∠𝑀 𝐶𝐴 = ∠𝐵𝐶𝐴 = 𝛾.

3) Ïóñòü 𝐵𝑀 è 𝐶𝑀 ïåðåñåêàþò îêðóæíîñòü 𝐴𝐵𝐶 â òî÷êàõ 𝐿 è 𝑇 ñî-

îòâåòñòâåííî. Òîãäà ∠𝐴𝐵𝑇 = ∠𝐴𝐶𝑇 = ∠𝑀 𝐴𝐵 , òàê ÷òî 𝐵𝑇 ‖ 𝐴𝑀 ; àíàëî-
ãè÷íî, 𝐴𝑇 ‖ 𝐵𝑀 , òàê ÷òî 𝐴𝑀 𝐵𝑇  ïàðàëëåëîãðàìì. Ñ÷èòàÿ, ÷òî äèàìåòð
îêðóæíîñòè 𝐴𝐵𝐶 ðàâåí 1, ïîëó÷àåì sin ∠𝑀 𝐴𝐵 = sin ∠𝑀 𝐶𝐴 = 𝐴𝑇 = 𝐵𝑀 .
Äàëåå, ∠𝐶𝐿𝑀 = ∠𝐶𝐴𝐵 = 𝛼, è èç êàñàíèÿ ∠𝐶𝑀 𝐿 = ∠𝐶𝐵𝐴 = 𝛽 , òàê
÷òî ∠𝑀 𝐶𝐿 = 𝛾 . Ïîñêîëüêó 𝛽 ≤ 𝛾 , ïîëó÷àåì sin ∠𝑀 𝐵𝐶 = 𝐶𝐿 ≤ 𝐿𝑀 . Èòàê,
sin ∠𝑀 𝐴𝐵 + sin ∠𝑀 𝐵𝐶 = 𝐴𝑇 + 𝐶𝐿 ≤ 𝐵𝑀 + 𝐿𝑀 = 𝐵𝐿 ≤ 1,
÷òî è òðåáîâàëîñü äîêàçàòü.

Второе решение. Ïðåäïîëîæèì ïðîòèâíîå. Îáîçíà÷èì ∠𝑀 𝐴𝐵 = 𝑥,

∠𝑀 𝐵𝐶 = 𝑦, ∠𝑀 𝐶𝐴 = 𝑧, ∠𝑀 𝐵𝐴 = 𝛼, ∠𝑀 𝐶𝐵 = 𝛽, ∠𝑀 𝐴𝐶 = 𝛾 . Ðàñ-
ñìîòðèì ñëó÷àè 𝑥 ≤ 𝑦 (ñëó÷àé 𝑥 ≥ 𝑦 àíàëîãè÷åí). Òîãäà 𝑥 ≤ 𝑦 ≤ 𝑧 è
𝑥 + 𝑦 + 𝑧 < 180∘ , ñëåäîâàòåëüíî, sin 𝑥 ≤ 𝑤 ≤ sin 𝑧 , ãäå 𝑤 = sin 𝑦 . Ïî ïðåäïî-
1
ëîæåíèþ sin 𝑥 > 1 − 𝑤 è 𝑤 > . Ïî òðèãîíîìåòðè÷åñêîé òåîðåìå ×åâû
2
sin 𝛼 sin 𝛽 sin 𝛾 = sin 𝑥 sin 𝑦 sin 𝑧 > 𝑤2 (1 − 𝑤). (1)
Ðàññìîòðèì ôóíêöèþ 𝑓 (𝑡) = sin 𝑡, ãäå 𝑡 ∈ (0, 𝜋). Çàìåòèì, ÷òî 𝑓 ′ (𝑡) = cos 𝑡
è 𝑓 ′′ (𝑡) = − sin 𝑡 < 0. Çíà÷èò äàííàÿ ôóíêöèÿ âîãíóòàÿ. Ïî íåðàâåíñòâó
Éåíñåíà
(︁ 𝜋 )︁
𝑆 = sin 𝑧 + sin 𝑦 + sin 𝑥 + sin 𝛼 + sin 𝛽 + sin 𝛾 ≤ 6 sin = 3. (2)
6
42 Solutions. Республиканская олимпиада 2021 года. 11 класс

Èç (1) è (2) è ïî íåðàâåíñòâó Êîøè èìååì, ÷òî

√︀ √︀
3 ≥ 𝑆 ≥ 2𝑤 + 4 4 sin 𝑥 sin 𝛼 sin 𝛽 sin 𝛾 > 2𝑤 + 4 𝑤(1 − 𝑤) ⇒

(3 − 2𝑤)2 > 16𝑤(1 − 𝑤) ⇒ 20𝑤2 − 28𝑤 + 9 > 0.

√
1 9 3
Òàê êàê 𝑤 > , òî èç ïîñëåäíåãî íåðàâåíñòâî ñëåäóåò, ÷òî 𝑤 > > .
2∘ 10 2
Çíà÷èò 𝑦 > 60 . Òàê êàê 𝛼 + 𝛽 + 𝛾 = 𝜋 − 𝑥 − 𝑦 − 𝑧 < 𝜋 − 2𝑦 < 𝜋 , òî ïî
íåðàâåíñòâó Êîøè è Éåíñåíà ïîëó÷èì, ÷òî
(︂ )︂3 (︂ )︂3 (︂ )︂3
sin 𝛼 + sin 𝛽 + sin 𝛾 𝛼+𝛽+𝛾 𝜋 − 2𝑦
sin 𝛼 sin 𝛽 sin 𝛾 ≤ ≤ sin < sin .
3 3 3
(3)
Èç (1) è (3) ïîëó÷èì, ÷òî
(︂ )︂3 (︂ )︂
𝜋 − 2𝑦 𝜋 − 2𝑦
4𝑤2 (1 − 𝑤) < 4 sin = 3 sin − sin 2𝑦. (4)
3 3
3
(Ïîñëåäíåå ðàâåíñòâî ñëåäóåò èç ôîðìóëû sin 3𝑡 = 3 sin 𝑡 − 4(sin 𝑡) .) Òàê
êàê 𝑦 ≤ 𝑧 , òî 𝑦 < 90∘ .
Ðàññìîòðèì ôóíêöèþ
(︂ )︂
𝜋 − 2𝑡 2 3
𝑔(𝑡) = 3 sin − sin 2𝑡 − 4(sin 𝑡) + 4(sin 𝑡)
3
[︁ 𝜋 𝜋 ]︁
â ïðîìåæóòêå 𝑡 ∈ , .
3 2
(︂ )︂
′ 𝜋 − 2𝑡 2
𝑔 (𝑡) = −2 cos − 2 cos 2𝑡 − 8 sin 𝑡 cos 𝑡 + 12(sin 𝑡) cos 𝑡 =
3
(︂ )︂
𝜋 − 2𝑡 2 2
= −2 cos + 2 − 4(cos 𝑡) − 8 sin 𝑡 cos 𝑡 + 12(sin 𝑡) cos 𝑡 ≥
3
2
≥ 4 cos 𝑡(3(sin 𝑡) − 2 sin 𝑡 − cos 𝑡). (5)
2
Ïóñòü ℎ(𝑡) = 3(sin 𝑡) − 2 sin 𝑡 − cos 𝑡. Òîãäà

ℎ′ (𝑡) = 6 sin 𝑡 cos 𝑡 − 2 cos 𝑡 + sin 𝑡 > 2 cos 𝑡(3 sin 𝑡 − 1) ≥ 0,

√
7−4 3(︁ 𝜋 )︁
ñëåäîâàòåëüíî ℎ  âîçðàñòàþùàÿ ôóíêöèÿ. Ïîýòîìó ℎ(𝑡) ≥ ℎ = >
3 4
0. Òîãäà èç (5) ñëåäóåò,
(︁ 𝜋 )︁ ÷òî 𝑔 (𝑡) ≥ 0. Çíà÷èò 𝑔  íåóáûâàþùàÿ ôóíêöèÿ,
′

ïîýòîìó 𝑔(𝑦) ≤ 𝑔 = 0. Íåðàâåíñòâî (4) íåâåðíî, ïðîòèâîðå÷èå.

2
Solutions. Республиканская олимпиада 2021 года. 11 класс 43

№4. Îñòðîóãîëüíûé òðåóãîëüíèê 𝐴𝐵𝐶 âïèñàí â îêðóæíîñòü Ω. Â ýòîì

òðåóãîëüíèêå ïðîâåäåíû âûñîòû 𝐴𝐷, 𝐵𝐸 è 𝐶𝐹 . Ïðÿìàÿ 𝐴𝐷 ïåðåñåêàåò Ω
âòîðè÷íî â òî÷êå 𝑃, à ïðÿìûå 𝑃 𝐹 è 𝑃 𝐸 ïåðåñåêàþò Ω âòîðè÷íî â òî÷êàõ
𝑅 è 𝑄 ñîîòâåòñòâåííî. Ïóñòü 𝑂1 è 𝑂2  öåíòðû îïèñàííûõ îêðóæíîñòåé
òðåóãîëüíèêîâ 𝐵𝐹 𝑅 è 𝐶𝐸𝑄 ñîîòâåòñòâåííî. Äîêàæèòå, ÷òî ïðÿìàÿ 𝑂1 𝑂2
äåëèò îòðåçîê 𝐸𝐹 ïîïîëàì. (Shyntas N.)

Решение. Ïóñòü 𝑀 ñåðåäèíà 𝐵𝐶 . Òàê êàê 𝑂1 𝐵 = 𝑂1 𝐹 è 𝑀 𝐵 = 𝑀 𝐹 ,

òî 𝑀 𝑂1 ⊥ 𝐵𝐹 . Ñëåäîâàòåëüíî, 𝑀 𝑂1 ‖ 𝐶𝐹 . Çàìåòèì, ÷òî ∠𝐵𝑂1 𝑀 =
∠𝐵𝑂1 𝐹
= ∠𝐵𝑅𝐹 = ∠𝐵𝑅𝑃 = ∠𝐵𝐴𝑃 = 90∘ − ∠𝐴𝐵𝐶 = ∠𝐵𝐶𝐹 = 𝐵𝑀 𝑂1 ,
2
òî åñòü ÷åòûðåõóãîëüíèê 𝑂1 𝐹 𝑀 𝐵  ðîìá. Ñëåäîâàòåëüíî, 𝑂1 𝐹 = 𝐵𝑀 è
𝑂1 𝐹 ‖ 𝐵𝐶 . Àíàëîãè÷íî, 𝐸𝑂2 = 𝐶𝑀 = 𝐵𝑀 è 𝐸𝑂2 ‖ 𝐵𝐶 . Çíà÷èò, ÷åòûðåõ-
óãîëüíèê 𝑂1 𝐹 𝑂2 𝐸  ïàðàëëåëîãðàìì, òî åñòü 𝑂1 𝑂2 äåëèò 𝐹 𝐸 ïîïîëàì.
Ω
A
A
R
R

Q
Q
O
O11111 F
F

O
O22222
E
E
D
D
B
B M
M C
C
P
P

№5. Ïóñòü 𝑎  íàòóðàëüíîå ÷èñëî. Äîêàæèòå, ÷òî äëÿ ëþáîãî ðåøåíèÿ

(𝑥, 𝑦) óðàâíåíèÿ
𝑥(𝑦 2 − 2𝑥2 ) + 𝑥 + 𝑦 + 𝑎 = 0
√
â öåëûõ ÷èñëàõ âûïîëíÿåòñÿ íåðàâåíñòâî: |𝑥| ≤ 𝑎 + 2𝑎2 + 2. (Osipov N.)

Решение. Ñì. ðåøåíèå çàäà÷è 10.6.

№6. Äàí ìíîãî÷ëåí 𝑃 (𝑥) ñ äåéñòâèòåëüíûìè êîýôôèöèåíòàìè è íàòóðàëü-
íîå ÷èñëî 𝑛. Èçâåñòíî, ÷òî äëÿ ëþáîãî íàòóðàëüíîãî 𝑚 ñóùåñòâóåò öåëîå
÷èñëî 𝑙 òàêîå, ÷òî 𝑃 (𝑙) = 𝑚𝑛 . Äîêàæèòå, ÷òî ñóùåñòâóþò äåéñòâèòåëüíûå
𝑘
÷èñëà 𝑎, 𝑏 è íàòóðàëüíîå ÷èñëî 𝑘 òàêèå, ÷òî 𝑃 (𝑥) = (𝑎𝑥 + 𝑏) ïðè âñåõ
äåéñòâèòåëüíûõ 𝑥. (Golovanov A.)

Решение. Ïóñòü 𝑘  ñòåïåíü ìíîãî÷ëåíà 𝑃 .

44 Solutions. Республиканская олимпиада 2021 года. 11 класс

Äëÿ êàæäîãî íàòóðàëüíîãî 𝑡 íàéä¼ì öåëîå ÷èñëî 𝑐𝑡 òàêîå, ÷òî 𝑃 (𝑐𝑡 ) =

2𝑡𝑘𝑛 (åñëè ýòîìó óñëîâèþ óäîâëåòâîðÿåò íåñêîëüêî ÷èñåë, âîçüì¼ì ëþáîå).
Ïðè ýòîì ìîæåò îêàçàòüñÿ, ÷òî 𝑐𝑡 è 𝑐𝑡+1 îäíîãî çíàêà äëÿ áåñêîíå÷íî ìíî-
ãèõ 𝑡, è òîãäà óðàâíåíèå 𝑃 (𝑦) = 2𝑘𝑛 𝑃 (𝑥) èìååò áåñêîíå÷íî ìíîãî öåëûõ
ðåøåíèé (𝑥, 𝑦) ñ 𝑥𝑦 > 0: òàêèìè ðåøåíèÿìè ÿâëÿþòñÿ âñå ïàðû (𝑐𝑡 , 𝑐𝑡+1 )
ñ ýëåìåíòàìè îäíîãî çíàêà. Åñëè æå ýòî íå òàê, ÷òî äëÿ âñåõ 𝑡, êðîìå êî-
íå÷íîãî ÷èñëà, îäèíàêîâûé çíàê èìåþò ÷èñëà 𝑐𝑡 è 𝑐𝑡+2 ; òîãäà áåñêîíå÷íî
ìíîãî öåëûõ ðåøåíèé (𝑥, 𝑦) ñ 𝑥𝑦 > 0 èìååò óðàâíåíèå 𝑃 (𝑦) = 4𝑘𝑛 𝑃 (𝑥). Â
îáîèõ ýòèõ ñëó÷àÿõ îêàçûâàåòñÿ, ÷òî äëÿ íåêîòîðîãî íàòóðàëüíîãî 𝑑 > 1
óðàâíåíèå 𝑃 (𝑦) = 𝑑𝑘 𝑃 (𝑥) èìååò áåñêîíå÷íî ìíîãî ðåøåíèé â öåëûõ ÷èñëàõ
îäíîãî çíàêà. Çàìåíèâ, åñëè íóæíî, ìíîãî÷ëåí 𝑃 (𝑥) íà ìíîãî÷ëåí 𝑃 (−𝑥),
ìû ìîæåì ñ÷èòàòü, ÷òî ñðåäè ýòèõ ðåøåíèé áåñêîíå÷íî ìíîãî òàêèõ, â êî-
òîðûõ 𝑥 è 𝑦 íàòóðàëüíû. Äîêàæåì, ÷òî èç ýòîãî ñâîéñòâà ìíîãî÷ëåíà 𝑃
ñëåäóåò óòâåðæäåíèå çàäà÷è.
Ïîñêîëüêó ìíîãî÷ëåí 𝑃 (𝑥) âîçðàñòàåò íà íåêîòîðîì ëó÷å (𝑥0 , +∞), ïðè
íåêîòîðîì ïîëîæèòåëüíîì 𝑀 èç íåðàâåíñòâà 𝑀 < 𝑃 (𝑥) < 𝑃 (𝑦) äëÿ ïîëî-
æèòåëüíûõ 𝑥 è 𝑦 ñëåäóåò, ÷òî 𝑥 < 𝑦 .  ÷àñòíîñòè, åñëè 𝑀 < 𝑃 (𝑥) < 𝑃 (𝑦) <
𝑃 (𝑥 + 1) äëÿ íåêîòîðîãî íàòóðàëüíîãî 𝑥 è ïîëîæèòåëüíîãî 𝑦 , òî ÷èñëî 𝑦 
íå öåëîå.
Ðàññìîòðèì äâà ñòàðøèõ êîýôôèöèåíòà ìíîãî÷ëåíà 𝑃 (𝑥):

𝑃 (𝑥) = 𝑎𝑘 𝑥𝑘 + 𝑎𝑘−1 𝑥𝑘−1 + . . .

Ñóùåñòâóåò åäèíñòâåííîå 𝑠0 òàêîå, ÷òî äâà ñòàðøèõ êîýôôèöèåíòà ìíîãî-

÷ëåíà 𝑃 (𝑑𝑥 + 𝑠0 ) îòëè÷àþòñÿ îò íèõ óìíîæåíèåì íà 𝑑𝑘 :

𝑃 (𝑑𝑥 + 𝑠0 ) = 𝑑𝑘 𝑎𝑘 𝑥𝑘 + 𝑑𝑘 𝑎𝑘−1 𝑥𝑘−1 + . . .

Äåéñòâèòåëüíî, 𝑃 (𝑑𝑥 + 𝑠0 ) = 𝑑𝑘 𝑎𝑘 𝑥𝑘 + 𝑑𝑘−1 (𝑎𝑘−1 + 𝑘𝑎𝑘 𝑠0 )𝑥𝑘−1 + . . . , òî åñòü

𝑠0 íàõîäèòñÿ èç ëèíåéíîãî óðàâíåíèÿ 𝑎𝑘−1 + 𝑘𝑎𝑘 𝑠0 = 𝑑𝑎𝑘−1 .
Ðàçáåð¼ì äâà ñëó÷àÿ.
I. ×èñëî 𝑠0 íå öåëîå. Îáîçíà÷èì 𝑠′ = [𝑠0 ]. Ìíîãî÷ëåí 𝑃 (𝑑𝑥 + 𝑠′ ) èìååò
òàêîé æå êîýôôèöèåíò ïðè 𝑥𝑘 , êàê ìíîãî÷ëåí 𝑑𝑘 𝑃 (𝑥), è ìåíüøèé êîýôôè-
öèåíò ïðè 𝑥𝑘−1 (òàê êàê 𝑑𝑘−1 (𝑎𝑘−1 + 𝑘𝑎𝑘 𝑠′ ) < 𝑑𝑘−1 (𝑎𝑘−1 + 𝑘𝑎𝑘 𝑠0 ) = 𝑑𝑘 𝑎𝑘−1 ).
Ýòî çíà÷èò, ÷òî 𝑃 (𝑑𝑥 + 𝑠′ ) < 𝑑𝑘 𝑃 (𝑥) ïðè âñåõ äîñòàòî÷íî áîëüøèõ 𝑥. Àíà-
ëîãè÷íî 𝑃 (𝑑𝑥 + 𝑠′ + 1) > 𝑑𝑘 𝑃 (𝑥) ïðè âñåõ äîñòàòî÷íî áîëüøèõ 𝑥.  ñèëó
ñäåëàííîãî âûøå çàìå÷àíèÿ ýòî çíà÷èò, ÷òî ïðè äîñòàòî÷íî áîëüøèõ 𝑥 ÷èñ-
ëî 𝑑𝑘 𝑃 (𝑥) íå ÿâëÿåòñÿ çíà÷åíèåì ìíîãî÷ëåíà 𝑃 â íàòóðàëüíîé òî÷êå, à ýòî
ïðîòèâîðå÷èò óñëîâèþ çàäà÷è.
II. ×èñëî 𝑠0 öåëîå. Äåéñòâóÿ òàê æå, êàê è â ñëó÷àå I, ïîëó÷èì, ÷òî

𝑃 (𝑑𝑥 + 𝑠0 − 1) < 𝑑𝑘 𝑃 (𝑥) < 𝑃 (𝑑𝑥 + 𝑠0 + 1)

Solutions. Республиканская олимпиада 2021 года. 11 класс 45

ïðè âñåõ äîñòàòî÷íî áîëüøèõ 𝑥. Åñëè (𝑥, 𝑦)  äîñòàòî÷íî áîëüøîå ðåøåíèå

óðàâíåíèÿ 𝑃 (𝑦) = 𝑑𝑘 𝑃 (𝑥) â íàòóðàëüíûõ ÷èñëàõ, èç ïîëó÷åííîãî íåðàâåí-
ñòâà ñëåäóåò, ÷òî 𝑦 = 𝑑𝑥 + 𝑠0 . Òàêèì îáðàçîì, ðàâåíñòâî

𝑃 (𝑑𝑥 + 𝑠0 ) = 𝑑𝑘 𝑃 (𝑥) (*)

âûïîëíÿåòñÿ äëÿ áåñêîíå÷íî ìíîãèõ çíà÷åíèé 𝑥. Ïîñêîëüêó ýòî ðàâåíñòâî

äâóõ ìíîãî÷ëåíîâ, îíî âûïîëíÿåòñÿ ïðè âñåõ 𝑥.
Ðàññìîòðèì ìíîãî÷ëåí 𝑄(𝑥) = 𝑃 (𝑥 − 𝑑−1
𝑠0
). Ïîñëå âûðàæåíèÿ ìíîãî÷ëå-
íà 𝑃 ÷åðåç 𝑄 ðàâåíñòâî (*) ïðèíèìàåò âèä
𝑠0 𝑠0
𝑄(𝑑𝑥 + 𝑠0 + ) = 𝑑𝑘 𝑄(𝑥 + ),
𝑑−1 𝑑−1
òî åñòü, òàê êàê 𝑑𝑥 + 𝑠0 + 𝑠0
𝑑−1 = 𝑑(𝑥 + 𝑑−1 ),
𝑠0

𝑄(𝑑𝑦) = 𝑑𝑘 𝑄(𝑦)

ïðè âñåõ âåùåñòâåííûõ 𝑥. Åñëè 𝑄(𝑦) = 𝑏𝑘 𝑦 𝑘 + 𝑏𝑘−1 𝑦 𝑘−1 + · · · + 𝑏0 , ïîëó÷àåì

òîæäåñòâî

𝑑𝑘 𝑏𝑘 𝑦 𝑘 + 𝑑𝑘−1 𝑏𝑘−1 𝑦 𝑘−1 + · · · + 𝑏0 = 𝑑𝑘 𝑏𝑘 𝑦 𝑘 + 𝑑𝑘 𝑏𝑘−1 𝑦 𝑘−1 + · · · + 𝑑𝑘 𝑏0 .

Ñðàâíèâàÿ êîýôôèöèåíòû, ïîëó÷àåì, ÷òî 𝑏𝑘−1 = · · · = 𝑏0 = 0, òî åñòü

ìíîãî÷ëåí 𝑄(𝑥) èìååò âèä 𝑎𝑥𝑘 . Äåëàÿ îáðàòíóþ çàìåíó 𝑃 (𝑥) = 𝑄(𝑥 + 𝑑+1
𝑠0
),
ïîëó÷àåì óòâåðæäåíèå çàäà÷è.