AoPS Community Russian TST 2015

www.artofproblemsolving.com/community/c3333109
by oVlad, N.T.TUAN, ComplexPhi, Nima Ahmadi Pour, hajimbrak, parmenides51, TheMaskedMagician

Days 1-6 Unavailable

Day 7 January 1, 2015

P1 A worm is called an adult if its length is one meter. In one operation, it is possible to cut an
adult worm into two (possibly unequal) parts, each of which immediately becomes a worm and
begins to grow at a speed of one meter per hour and stops growing once it reaches one meter in
length. What is the smallest amount of time in which it is possible to get n adult worms starting
with one adult worm? Note that it is possible to cut several adult worms at the same time.

P2 In the isosceles triangle ABC where AB = AC, the point I is the center of the inscribed cir-
cle. Through the point A all the rays lying inside the angle BAC are drawn. For each such ray,
we denote by X and Y the points of intersection with the arc BIC and the straight line BC
respectively. The circle γ passing through X and Y , which touches the arc BIC at the point X
is considered. Prove that all the circles γ pass through a fixed point.

P3 Let 0 < α < 1 be a fixed number. On a lake shaped like a convex polygon, at some point there is
a duck and at another point a water lily grows. If the duck is at point X, then in one move it can
swim towards one of the vertices Y of the polygon a distance equal to a α · XY . Find all α for
which, regardless of the shape of the lake and the initial positions of the duck and the lily, after
a sequence of adequate moves, the distance between the duck and the lily will be at most one
meter.

P4 Let p ≥ 5 be a prime number. Prove that there exists a positive integer a < p − 1 such that
neither of ap−1 − 1 and (a + 1)p−1 − 1 is divisible by p2 .

Day 8 June 6, 2016 (Group NG)

P1 Let P (x, y) and Q(x, y) be polynomials in two variables with integer coefficients. The sequences
of integers a0 , a1 , . . . and b0 , b1 , . . . satisfy

an+1 = P (an , bn ), bn+1 = Q(an , bn )

for all n ⩾ 0. Let mn be the number of integer points of the coordinate plane, lying strictly inside
the segment with endpoints (an , bn ) and (an+1 , bn+1 ). Prove that the sequence m0 , m1 , . . . non-
decreasing.

© 2023 AoPS Incorporated 1

AoPS Community Russian TST 2015

P2 The triangle ABC is given. Let P1 and P2 be points on the side AB such that P2 lies on the
segment BP1 and AP1 = BP2 . Similarly, Q1 and Q2 are points on the side BC such that Q2 lies
on the segment BQ1 and BQ1 = CQ2 . The segments P1 Q2 and P2 Q1 intersect at the point R,
and the circles P1 P2 R and Q1 Q2 R intersect a second time at the point S lying inside the triangle
P1 Q1 R. Let M be the midpoint of the segment AC. Prove that the angles P1 RS and Q1 RM are
equal.

P3 Given two integers h ≥ 1 and p ≥ 2, determine the minimum number of pairs of opponents
an hp-member parliament may have, if in every partition of the parliament into h houses of p
member each, some house contains at least one pair of opponents.

Day 8 June 6, 2016 (Groups A & B)

P1 Let n > 4 be a natural number. Prove that

n r
X k k
< n.
k−1
k=2

P2 The same as P1 from Day 8, Group NG

P3 The same as P2 from Day 8, Group NG

P4 Let G be a tournoment such that it’s edges are colored either red or blue.
Prove that there exists a vertex of G like v with the property that, for every other vertex u there
is a mono-color directed path from v to u.

Day 9 June 7, 2015 (Group NG)

P1 We have 2m sheets of paper, with the number 1 written on each of them. We perform the follow-
ing operation. In every step we choose two distinct sheets; if the numbers on the two sheets
are a and b, then we erase these numbers and write the number a + b on both sheets. Prove that
after m2m−1 steps, the sum of the numbers on all the sheets is at least 4m .
Proposed by Abbas Mehrabian, Iran

P2 Given an acute triangle ABC, H is the foot of the altitude drawn from the point A on the line
BC, P and K ̸= H are arbitrary points on the segments AH andBC respectively. Segments
AC and BP intersect at point B1 , lines AB and CP at point C1 . Let X and Y be the projections
of point H on the lines KB1 and KC1 , respectively. Prove that points A, P, X and Y lie on one
circle.

P3 Find all functions f : Z → Z such that

n2 + 4f (n) = f (f (n))2

© 2023 AoPS Incorporated 2

AoPS Community Russian TST 2015

for all n ∈ Z.
Proposed by Sahl Khan, UK

Day 9 June 7, 2015 (Groups A & B)

P1 Find all pairs of natural numbers (a, b) satisfying the following conditions:
-b − 1 is divisible by a + 1 and
-a2 + a + 2 is divisible by b.

P2 The same as P1 from Day 9, Group NG

P3 The same as P2 from Day 9, Group NG

P4 The same as P3 from Day 9, Group NG

Day 10 June 15, 2015 (Group NG)

P1 The points A′ , B ′ , C ′ , D′ are selected respectively on the sides AB, BC, CD, DA of the cyclic
quadrilateral ABCD. It is known that AA′ = BB ′ = CC ′ = DD′ and

∠AA′ D′ = ∠BB ′ A′ = ∠CC ′ B ′ = ∠DD′ C ′ .

Prove that ABCD is a square.

P2 Let p be an odd prime number. Prove that the set {1, 2, . . . , p − 1} can be divided into two
nonempty subsets so that the sum of all the numbers in one subset and the product of all the
numbers in the other subset give the same remainder modulo p.

P3 Fix positive integers n and k ≥ 2. A list of n integers is written in a row on a blackboard. You
can choose a contiguous block of integers, and I will either add 1 to all of them or subtract 1
from all of them. You can repeat this step as often as you like, possibly adapting your selections
based on what I do. Prove that after a finite number of steps, you can reach a state where at
least n − k + 2 of the numbers on the blackboard are all simultaneously divisible by k.

Day 10 June 15, 2015 (Groups A & B)

P1 A particular case of P3 from Day 10, Group NG

P2 The same as P1 from Day 10, Group NG

P3 Find all integers k for which there are infinitely many triples of integers (a, b, c) such that

(a2 − k)(b2 − k) = c2 − k.

© 2023 AoPS Incorporated 3

AoPS Community Russian TST 2015

P4 Let M be a set of n ≥ 4 points in the plane, no three of which are collinear. Initially these points
are connected with n segments so that each point in M is the endpoint of exactly two segments.
Then, at each step, one may choose two segments AB and CD sharing a common interior point
and replace them by the segments AC and BD if none of them is present at this moment. Prove
that it is impossible to perform n3 /4 or more such moves.
Proposed by Vladislav Volkov, Russia

Day 11 June 17, 2016 (Group NG)

P1 A 2015×2015 chessboard is given, the cells of which are painted white and black alternatively so
that the corner cells are black. There are n L-trominoes (https://i.stack.imgur.com/V1kdh.
png) placed on the board, no two of which overlap and which cover all of the black cells. Find
the smallest possible value of n.

P2 Let a, b, c, d be positive real numbers satisfying a2 + b2 + c2 + d2 = 1. Prove that

 
3 3 3 3 1 1 1 1
a + b + c + d + abcd + + + ⩽ 1.
a b c d

P3 The triangle ABC is given. Let A′ be the midpoint of the side BC, Bc be the projection of B onto
the bisector of the angle ACB and Cb be the projection of the point C onto the bisector of the
angle ABC. Let A0 be the center of the circle passing through A′ , Bc , Cb . The points B0 and C0
are defined similarly. Prove that the incenter of the triangle ABC coincides with the orthocenter
of the triangle A0 B0 C0 .

Day 11 June 17, 2016 (Groups A & B)

P1 Prove that there exist two natural numbers a, b such that |a−m|+|b−n| > 1000 for any relatively
prime natural numbers m, n.

P2 The same as P1 from Day 11, Group NG

P3 The same as P2 from Day 11, Group NG

P4 The same as P3 from Day 11, Group NG

© 2023 AoPS Incorporated 4

Art of Problem Solving is an ACS WASC Accredited School.