AoPS Community 2018 Baltic Way

Baltic Way 2018

www.artofproblemsolving.com/community/c768179
by Tintarn

1 A finite collection of positive real numbers (not necessarily distinct) is balanced if each number
is less than the sum of the others. Find all m ≥ 3 such that every balanced finite collection of
m numbers can be split into three parts with the property that the sum of the numbers in each
part is less than the sum of the numbers in the two other parts.

2 A 100 × 100 table is given. For each k, 1 ≤ k ≤ 100, the k-th row of the table contains the
numbers 1, 2, . . . , k in increasing order (from left to right) but not necessarily in consecutive
cells; the remaining 100 − k cells are filled with zeroes. Prove that there exist two columns
such that the sum of the numbers in one of the columns is at least 19 times as large as the
sum of the numbers in the other column.

3 Let a, b, c, d be positive real numbers such that abcd = 1. Prove the inequality
1 1 1 1
√ +√ +√ +√ ≤ 1.
a + 2b + 3c + 10 b + 2c + 3d + 10 c + 2d + 3a + 10 d + 2a + 3b + 10

4 Find all functions f : [0, ∞) → [0, ∞), such that for any positive integer n and and for any
non-negative real numbers x1 , x2 , . . . , xn

f (x21 + . . . + x2n ) = f (x1 )2 + · · · + f (xn )2 .

5 A polynomial f (x) with real coefficients is called generating, if for each polynomial ϕ(x) with
real coefficients there exists a positive integer k and polynomials g1 (x), . . . , gk (x) with real
coefficients such that
ϕ(x) = f (g1 (x)) + . . . + f (gk (x)).
Find all generating polynomials.

6 Let n be a positive integer. Elfie the Elf travels in R3 . She starts at the origin: (0, 0, 0). In each
√
turn she can teleport to any point with integer coordinates which lies at distance exactly n
from her current location. However, teleportation is a complicated procedure: Elfie starts off
normal but she turns strange with her first teleportation. Next time she teleports she turns
normal again, then strange again... etc.
For which n can Elfie travel to any point with integer coordinates and be normal when she gets
there?

© 2019 AoPS Incorporated 1

AoPS Community 2018 Baltic Way

7 On a 16 × 16 torus as shown all 512 edges are colored red or blue. A coloring is good if every
vertex is an endpoint of an even number of red edges. A move consists of switching the color
of each of the 4 edges of an arbitrary cell. What is the largest number of good colorings so
that none of them can be converted to another by a sequence of moves?

8 A graph has N vertices. An invisible hare sits in one of the vertices. A group of hunters tries
to kill the hare. In each move all of them shoot simultaneously: each hunter shoots at a single
vertex, they choose the target vertices cooperatively. If the hare was in one of the target ver-
tices during a shoot, the hunt is finished. Otherwise the hare can stay in its vertex or jump to
one of the neighboring vertices.
The hunters know an algorithm that allows them to kill the hare in at most N ! moves. Prove
that then there exists an algorithm that allows them to kill the hare in at most 2N moves.

9 Olga and Sasha play a game on an infinite hexagonal grid. They take turns in placing a stone
on a free hexagon of their choice. Olga starts the game. Just before the 2018th stone is placed,
a new rule comes into play. A stone may now be placed only on those free hexagons having
at least two occupied neighbors.
A player loses when she or he either is unable to make a move, or makes a move such that
a pattern of the rhomboid shape as shown (rotated in any possible way) appears. Determine
which player, if any, possesses a winning strategy.

10 The integers from 1 to n are written, one on each of n cards. The first player removes one card.
Then the second player removes two cards with consecutive integers. After that the first player
removes three cards with consecutive integers. Finally, the second player removes four cards
with consecutive integers.
What is th smallest value of n for which the second player can ensure that he competes both
his moves?

11 The points A, B, C, D lie, in this order, on a circle ω, where AD is a diameter of ω. Furthermore,

AB = BC = a and CD = c for some relatively prime integers a and c. Show that if the diameter
d of ω is also an integer, then either d or 2d is a perfect square.

12 The altitudes BB1 and CC1 of an acute triangle ABC intersect in point H. Let B2 and C2 be
points on the segments BH and CH, respectively, such that BB2 = B1 H and CC2 = C1 H. The
circumcircle of the triangle B2 HC2 intersects the circumcircle of the triangle ABC in points
D and E. Prove that the triangle DEH is right-angled.

13 The bisector of the angle A of a triangle ABC intersects BC in a point D and intersects the
circumcircle of the triangle ABC in a point E. Let K, L, M and N be the midpoints of the
segments AB, BD, CD and AC, respectively. Let P be the circumcenter of the triangle EKL,
and Q be the circumcenter of the triangle EM N . Prove that ∠P EQ = ∠BAC.

© 2019 AoPS Incorporated 2

AoPS Community 2018 Baltic Way

14 A quadrilateral ABCD is circumscribed about a circle ω. The intersection point of ω and the
diagonal AC, closest to A, is E. The point F is diametrally opposite to the point E on the circle
ω. The tangent to ω at the point F intersects lines AB and BC in points A1 and C1 , and lines
AD and CD in points A2 and C2 , respectively. Prove that A1 C1 = A2 C2 .

15 Two circles in the plane do not intersect and do not lie inside each other. We choose diameters
A1 B1 and A2 B2 of these circles such that the segments A1 A2 and B1 B20 intersect. Let A and
B be the midpoints of the segments A1 A2 and B1 B2 , and C be the intersection point of these
segments. Prove that the orthocenter of the triangle ABC belongs to a fixed line that does not
depend on the choice of diameters.

Let p be an odd prime. Find all positive integers n for which n2 − np is a positive integer.
p
16
√
17 Prove that for any positive integers p, q such that 11 > pq , the following inequality holds:

√ p 1
11 − > .
q 2pq

18 Let n ≥ 3 be an integer such that 4n + 1 is a prime number. Prove that 4n + 1 divides n2n − 1.

19 An infinite set B consisting of positive integers has the following property. For each a, b ∈ B
with a > b the number (a,b)
a−b
belongs to B. Prove that B contains all positive integers. Here,
(a, b) is the greatest common divisor of numbers a and b.

20 Find all the triples of positive integers (a, b, c) for which the number

(a + b)4 (b + c)4 (c + a)4

+ +
c a b
is an integer and a + b + c is a prime.

© 2019 AoPS Incorporated 3

Art of Problem Solving is an ACS WASC Accredited School.