AoPS Community Russian TST 2019

www.artofproblemsolving.com/community/c3315879
by oVlad, IndoMathXdZ, Functional, psi241, Tsukuyomi, Neothehero, GorgonMathDota, Miquel-point, par-
menides51, CantonMathGuy, Pinionrzek, huricane, Dadgarnia, GoJensenOrGoHome

Day 1 October 21, 2018

P1 Determine all pairs (n, k) of distinct positive integers such that there exists a positive integer s
for which the number of divisors of sn and of sk are equal.

P2 Let n be a given positive integer. Sisyphus performs a sequence of turns on a board consisting
of n + 1 squares in a row, numbered 0 to n from left to right. Initially, n stones are put into square
0, and the other squares are empty. At every turn, Sisyphus chooses any nonempty square, say
with k stones, takes one of these stones and moves it to the right by at most k squares (the
stone should say within the board). Sisyphus’ aim is to move all n stones to square n.
Prove that Sisyphus cannot reach the aim in less than
lnm lnm lnm lnm
+ + + ··· +
1 2 3 n
turns. (As usual, ⌈x⌉ stands for the least integer not smaller than x. )

P3 Let m, n ≥ 2 be integers. Let f (x1 , . . . , xn ) be a polynomial with real coefficients such that
 
x1 + · · · + xn
f (x1 , . . . , xn ) = for every x1 , . . . , xn ∈ {0, 1, . . . , m − 1}.
m

Prove that the total degree of f is at least n.

Day 2 October 22, 2018

P1 Let Q>0 denote the set of all positive rational numbers. Determine all functions f : Q>0 → Q>0
satisfying
f (x2 f (y)2 ) = f (x)2 f (y)
for all x, y ∈ Q>0

P2 Let ABC be a triangle with circumcircle Ω and incentre I. A line ℓ intersects the lines AI, BI, and
CI at points D, E, and F , respectively, distinct from the points A, B, C, and I. The perpendicular
bisectors x, y, and z of the segments AD, BE, and CF , respectively determine a triangle Θ.
Show that the circumcircle of the triangle Θ is tangent to Ω.

© 2023 AoPS Incorporated 1

AoPS Community Russian TST 2019

P3 Consider 2018 pairwise crossing circles no three of which are concurrent. These circles subdi-
vide the plane into regions bounded by circular edges that meet at vertices. Notice that there
are an even number of vertices on each circle. Given the circle, alternately colour the vertices
on that circle red and blue. In doing so for each circle, every vertex is coloured twice- once for
each of the two circle that cross at that point. If the two colours agree at a vertex, then it is
assigned that colour; otherwise, it becomes yellow. Show that, if some circle contains at least
2061 yellow points, then the vertices of some region are all yellow.

Proposed by India

Day 3 January 10, 2019

P1 A circle ω with radius 1 is given. A collection T of triangles is called good, if the following con-
ditions hold:
- each triangle from T is inscribed in ω;
- no two triangles from T have a common interior point.
Determine all positive real numbers t such that, for each positive integer n, there exists a good
collection of n triangles, each of perimeter greater than t.

P2 Given any set S of positive integers, show that at least one of the following two assertions holds:
(1) There exist distinct finite subsets F and G of S such that x∈F 1/x = x∈G 1/x;
P P

(2) There exists a positive rational number r < 1 such that x∈F 1/x ̸= r for all finite subsets
P
F of S.

P3 Four positive integers x, y, z and t satisfy the relations

xy − zt = x + y = z + t.

Is it possible that both xy and zt are perfect squares?

Day 4 January 11, 2019

P1 Let n > 1 be a positive integer. Each cell of an n × n table contains an integer. Suppose that the
following conditions are satisfied:
- Each number in the table is congruent to 1 modulo n.
- The sum of numbers in any row, as well as the sum of numbers in any column, is congruent to
n modulo n2 .
Let Ri be the product of the numbers in the ith row, and Cj be the product of the number in the
j th column. Prove that the sums R1 + . . . Rn and C1 + . . . Cn are congruent modulo n4 .

© 2023 AoPS Incorporated 2

AoPS Community Russian TST 2019

P2 For each permutation σ of the set {1, 2, . . . , N } we define its correctness as the number of triples
1 ⩽ i < j < k ⩽ N such that the number σ(j) lies between the numbers σ(i) and σ(k). Find
the difference between the number of permutations with even correctness and the number of
permutations with odd correctness if a) N = 2018 and b) N = 2019.

P3 Inside the acute-angled triangle ABC we take P and Q two isogonal conjugate points. The
perpendicular lines on the interior angle-bisector of ∠BAC passing through P and Q intersect
the segments AC and AB at the points Bp ∈ AC, Bq ∈ AC, Cp ∈ AB and Cq ∈ AB, respectively.
Let W be the midpoint of the arc BAC of the circle (ABC). The line W P intersects the circle
(ABC) again at P1 and the line W Q intersects the circle (ABC) again at Q1 . Prove that the
points P1 , Q1 , Bp , Bq , Cp and Cq lie on a circle.
Proposed by P. Bibikov

Day 5 May 6, 2019

P1 A school organizes optional lectures for 200 students. At least 10 students have signed up for
each proposed lecture, and for any two students there is at most one lecture that both of them
have signed up for. Prove that it is possible to hold all these lectures over 211 days so that no
one has to attend two lectures in one day.

P2 Let a0 , a1 , a2 , . . . be a sequence of real numbers such that a0 = 0, a1 = 1, and for every n ≥ 2

there exists 1 ≤ k ≤ n satisfying
an−1 + · · · + an−k
an = .
k
Find the maximum possible value of a2018 − a2017 .

P3 Let Ω be the circumcircle of an acute-angled triangle ABC. A point D is chosen on the internal
bisector of ∠ACB so that the points D and C are separated by AB. A circle ω centered at D is
tangent to the segment AB at E. The tangents to ω through C meet the segment AB at K and
L, where K lies on the segment AL. A circle Ω1 is tangent to the segments AL, CL, and also to
Ω at point M . Similarly, a circle Ω2 is tangent to the segments BK, CK, and also to Ω at point
N . The lines LM and KN meet at P . Prove that ∠KCE = ∠LCP .
Poland

Day 6 May 7, 2019

P1 Unavailable

P2 Prove that for every odd prime number p, the following congruence holds
p−1
X
np−1 ≡ (p − 1)! + p (mod p2 ).
n=1

© 2023 AoPS Incorporated 3

AoPS Community Russian TST 2019

P3 Find the maximal value of

r r r r
3
a 3 b 3
c 3 d
S= + + + ,
b+7 c+7 d+7 a+7
where a, b, c, d are nonnegative real numbers which satisfy a + b + c + d = 100.
Proposed by Evan Chen, Taiwan

Day 7 June 26, 2019 (Group NG)

P1 Let a0 , a1 , . . . , an and b0 , b1 , . . . , bn be sequences of real numbers such that a0 = b0 ⩾ 0, an =

bn > 0 and r r
ai+1 + ai−1 bi+1 + bi−1
ai = , bi = ,
2 2
for all i = 1, . . . , n − 1. Prove that a1 = b1 .

P2 Let I be an incenter of △ABC. Denote D, S ̸= A intersections of AI with BC, O(ABC) re-

spectively. Let K, L be incenters of △DSB, △DCS. Let P be a reflection of I with the respect
to KL. Prove that BP ⊥ CP .

P3 Let S be the set of sequences of length 2018 whose terms are in the set {1, 2, 3, 4, 5, 6, 10} and
sum to 3860. Prove that the cardinality of S is at most

2018 2018
 
3860
2 · .
2048

Day 7 June 26, 2019 (Groups A & B)

P1 A positive integer n is called discontinuous if for all its natural divisors 1 = d0 < d1 < · · · < dk ,
written out in ascending order, there exists 1 ⩽ i ⩽ k such that di > di−1 + · · · + d1 + d0 + 1.
Prove that there are infinitely many positive integers n such that n, n + 1, . . . , n + 2019 are all
discontinuous.

P2 The same as P1 from Day 7, Group NG

P3 The same as P2 from Day 7, Group NG

P4 The same as P3 from Day 7, Group NG

Day 8 June 28, 2019 (Group NG)

© 2023 AoPS Incorporated 4

AoPS Community Russian TST 2019

P1 Suppose that A, B, C, and D are distinct points, no three of which lie on a line, in the Euclidean
plane. Show that if the squares of the lengths of the line segments AB, AC, AD, BC, BD, and
CD are rational numbers, then the quotient

area(△ABC)
area(△ABD)

is a rational number.

P2 Two ants are moving along the edges of a convex polyhedron. The route of every ant ends in
its starting point, so that one ant does not pass through the same point twice along its way. On
every face F of the polyhedron are written the number of edges of F belonging to the route of
the first ant and the number of edges of F belonging to the route of the second ant. Is there a
polyhedron and a pair of routes described as above, such that only one face contains a pair of
distinct numbers?

Proposed by Nikolai Beluhov

P3 Let P (x) be a nonconstant complex coefficient polynomial and let Q(x, y) = P (x) − P (y). Sup-
pose that polynomial Q(x, y) has exactly k linear factors unproportional two by tow (without
counting repetitons). Let R(x, y) be factor of Q(x, y) of degree strictly smaller than k. Prove
that R(x, y) is a product of linear polynomials.
Note: The degree of nontrivial polynomial m n cm,n xm y n is the maximum of m + n along all
P P
nonzero coefficients cm,n . Two polynomials are proportional if one of them is the other times a
complex constant.
Proposed by Navid Safaie

Day 8 June 28, 2019 (Groups A & B)

P1 A convex pentagon AP BCQ is given such that AB < AC. The circle ω centered at point A
passes through P and Q and touches the segment BC at point R. Let the circle Γ centered at
the point O be the circumcircle of the triangle ABC. It is known that AO ⊥ P Q and ∠BQR =
∠CP R. Prove that the tangents at points P and Q to the circle ω intersect on Γ.

P2 The same as P1 from Day 8, Group NG

P3 Define the sequence a0 , a1 , a2 , . . . by an = 2n + 2⌊n/2⌋ . Prove that there are infinitely many terms
of the sequence which can be expressed as a sum of (two or more) distinct terms of the se-
quence, as well as infinitely many of those which cannot be expressed in such a way.

P4 The same as P3 from Day 8, Group NG

© 2023 AoPS Incorporated 5

AoPS Community Russian TST 2019

Day 9 July 4, 2019 (Group NG)

P1 Let n > 1 be a positive integer. Show that the number of residues modulo n2 of the elements of
the set {xn + y n : x, y ∈ N} is at most n(n+1)
2 .
Proposed by N. Safaei (Iran)

P2 Determine all functions f : (0, ∞) → R satisfying

 
1 y
x+ f (y) = f (xy) + f
x x

for all x, y > 0.

P3 Let O be the circumcentre, and Ω be the circumcircle of an acute-angled triangle ABC. Let P be
an arbitrary point on Ω, distinct from A, B, C, and their antipodes in Ω. Denote the circumcentres
of the triangles AOP , BOP , and COP by OA , OB , and OC , respectively. The lines ℓA , ℓB , ℓC
perpendicular to BC, CA, and AB pass through OA , OB , and OC , respectively. Prove that the
circumcircle of triangle formed by ℓA , ℓB , and ℓC is tangent to the line OP .

Day 9 July 4, 2019 (Groups A & B)

P1 The shores of the Tvertsy River are two parallel straight lines. There are point-like villages on the
shores in some order: 20 villages on the left shore and 15 villages on the right shore. We want
to build a system of non-intersecting bridges, that is, segments connecting a couple of villages
from different shores, so that from any village you can get to any other village only by bridges
(you can’t walk along the shore). In how many ways can such a bridge system be built?

P2 The same as P1 from Day 9, Group NG

P3 Let H be the orthocenter of the acute-angled triangle ABC. In the triangle BHC, the median
HM and the symedian HL are drawn. The point K is marked on the line LH so that ∠AKL =
90◦ . Prove that the circumcircles of the triangles ABC and KLM are tangent.

P4 The same as P2 from Day 9, Group NG

Day 10 July 5, 2019 (Group NG)

P1 Point M is the middle of the side side AB of the isosceles triangle ABC. On the extension of
the base AC, point D is marked such that C is between A and D, and point E is marked on the
segment BM . The circumcircle of the triangle CDE intersects the segment M E a second time
at point F . Prove that it is possible to make a triangle from the segments AD, DE and AF .

© 2023 AoPS Incorporated 6

AoPS Community Russian TST 2019

P2 Numbers m and n are given positive integers. There are mn people in a party, standing in the
shape of an m × n grid. Some of these people are police officers and the rest are the guests.
Some of the guests may be criminals. The goal is to determine whether there is a criminal be-
tween the guests or not.

Two people are considered adjacent if they have a common side. Any police officer can see
their adjacent people and for every one of them, know that they’re criminal or not. On the other
hand, any criminal will threaten exactly one of their adjacent people (which is likely an officer!)
to murder. A threatened officer will be too scared, that they deny the existence of any criminal
between their adjacent people.

Find the least possible number of officers such that they can take position in the party, in a way
that the goal is achievable. (Note that the number of criminals is unknown and it is possible to
have zero criminals.)
Proposed by Abolfazl Asadi

P3 Prove that there are infinitely many positive integers m such that the number of odd distinct
prime factor of m(m + 3) is a multiple of 3.

Day 10 July 5, 2019 (Groups A & B)

P1 Let t ∈ (1, 2). Show that there exists a polynomial P (x) = an xn + an−1 xn−1 + ... + a1 x + a0 with
the coefficients in {1, −1} such that |P (t) − 2019| ⩽ 1.
Proposed by N. Safaei (Iran)

P2 The same as P1 from Day 10, Group NG

P3 The same as P2 from Day 10, Group NG

P4 The same as P3 from Day 10, Group NG

© 2023 AoPS Incorporated 7

Art of Problem Solving is an ACS WASC Accredited School.