MATHEMATICAL COMPETITIONS IN THE

REPUBLIC OF KOSOVA IN 2019

PRISHTINË, 2019
i = 1,2,3,4,5.
 MATHEMATICAL COMPETITIONS IN THE

REPUBLIC OF KOSOVA

IN 2019

The Kosovar Mathematical Society has been established on August

22nd, 2008. Like other similar organizations, Kosovar Mathematical
Society’s main goal includes the promotion of mathematics
education, while its main activities are related to the organization of
different math contests.
Since 2009, Kosovo participates in the International Mathematical
Olympiad. Our highest achievements so far include two bronze
medals: Doruntina Sylejmani (2016) (student at Princeton University)
and Shend Zhjeqi (2017) (student at UCLA).
Regarding other competitions, our students during the last two years
attended the Iranian Geometry Olympiad and the European
Mathematical Cup.
We are applying to other institutions that organize mathematics
competitions. However, sometimes POLITICS wins against MATH
(consequently it wins over culture and education). Recently, we were
rejected by Massee, which was a way for us to have our students
attend Balkan Mathematics Olympiad, Junior Balkan Mathematical

1
Olympiad and so on, and all this (and not only this!) due to the
refusal from our mathematician colleagues from the Serbian
Mathematical Society, the latter being influenced by Serbian politics.
However, after bad news come (at least one) good news.
Starting from next year, we will participate in The European Girls’
Mathematical Olympiad in Netherlands. Also, beginning from next
year we will organize, jointly with Albanian Mathematical
Association, “Kosovo-Albanian Junior Mathematics Competitions”,
etc.
And of course, we will not stop until Math really wins over Politics!
Coming to the Math competitions in the Republic of Kosova, they are
organized from the 9th to 12th grade. Initially, schools organize the
internal math competitions and select students to attend the
Municipality Competitions. KMS sends the problems to all
Municipalities which organize the competitions simultaneously. The
winners of this round represent their respective municipalities in the
National Competitions (Final Round). Usually, around 200 students
attend the National Mathematics Competitions. The five best of each
grade qualify for the Team Selection Test, which gives us the Kosovar
IMO team.
This year our team for IMO is composed of the following students:
Leart Ajvazaj (grade 12)
Viktor Ahmeti (grade 12)
Duart Nishefci (grade 12)
Urim Hoxha (grade 12)
Dren Neziri (grade 11)
Fisnik Topalli (grade 11)

2
1. Final Round – National Competitions - Problems
Grade 9

Problem 9.1. Evaluate 12 − 22 + 32 − 42 + ⋯ − 20182 + 20192 .

Problem 9.2. Prove that the sum of the product of three consecutive
positive integers and their arithmetic mean is a perfect cube.
Problem 9.3. Let 𝐴𝐵𝐶𝐷 be a rectangle such that 𝐴𝐵 > 𝐵𝐶. Let 𝐸, 𝐹 be
two points on the side 𝐶𝐷 such that 𝐶𝐸 = 𝐸𝐷 and 𝐵𝐶 = 𝐶𝐹. Prove that if
𝐵𝐸 is perpendicular to 𝐴𝐶 then 𝐴𝐵 = 𝐵𝐹.
Problem 9.4. Find all sequences of consecutive positive integers whose
sum equals 2019.
Problem 9.5. A student writes the numbers 1, 2, 3, … ,18 on the
blackboard. What is the minimum number of numbers one needs to
delete from the above list, so that that the sum of any two of the
remaining numbers is not a perfect square?

Grade 10
2019!
Problem 10.1. Find the last three digits of .
21009

Problem 10.2. Prove that for all positive real numbers a, b and c
4(𝑎3 + 𝑏 3 + 𝑐 3 + 3) ≥ 3(𝑎 + 1)(𝑏 + 1)(𝑐 + 1).
Determine when equality occurs.
Problem 10.3. A doctor advised his patient to get 48 pills during 30
days, in such a way that the patient should take at least one pill during
the day and not more than 6 pills a day. Prove that, no matter how the
patient acts, there are two consecutive days during which he took 11
pills in total.

3
Problem 10.4. Find all real numbers 𝑥, 𝑦, 𝑧 such that
�𝑥 3 − 𝑦 = 𝑧 − 1
��𝑦 3 − 𝑧 = 𝑥 − 1.
√𝑧 3 − 𝑥 = 𝑦 − 1
Problem 10.5. Let 𝐴𝐵𝐶𝐷𝐸 be a regular pentagon. Let 𝐹 be the
intersection point of segments 𝐴𝐶 and 𝐵𝐷. Let 𝐺 be a point on the
segment 𝐴𝐷 such that 2𝐴𝐷 = 3𝐴𝐺. Let 𝐻 be the midpoint of the side 𝐷𝐸.
Prove that the points 𝐹, 𝐺, 𝐻 are collinear.

Grade 11

Problem 11.1. Let 𝑎 and 𝑏 be real numbers greater than 4. Prove that at
least one of the quadratic trinomials 𝑥 2 + 𝑎𝑥 + 𝑏 , 𝑥 2 + 𝑏𝑥 + 𝑎 has two
different real roots.
Problem 11.2. Find all positive integers 𝑛 such that when 6𝑛 + 1 is
written in decimal form it has all digits equal.
Problem 11.3. Let 𝐴𝐵𝐶 be a triangle such that ∠𝐶𝐴𝐵 = 60∘ . Let 𝐼 the
incenter of triangle 𝐴𝐵𝐶. Let 𝐷 and 𝐸 be points on sides 𝐴𝐶 and 𝐴𝐵,
respectively, such that 𝐵𝐷 and 𝐶𝐸 bisect angles ∠𝐴𝐵𝐶 and ∠𝐵𝐶𝐴,
respectively. Prove that 𝐼𝐷 = 𝐼𝐸.
Problem 11.4. Find all functions 𝑓: ℝ → ℝ such that
𝑓�𝑥𝑦 + 𝑓(𝑥)� = 𝑥𝑓(𝑦) for all 𝑥, 𝑦 ∈ ℝ.
Problem 11.5. Points (𝑚, 𝑛) with positive integer coordinates such that
1 ≤ 𝑚, 𝑛 ≤ 4 are given in a coordinate plane. Two players, Agon and
Ben, play the following game: first, Agon colors with red one of the
points. Then, in his turn Ben colors one of the remaining points with
yellow. The process repeats. The winner is the player who first forms a
rectangle with positive integer sides whose vertices have the same
color, otherwise game ends in draw. Is there a strategy for any of the
players to win the game?

4
 Grade 12
Problem 12.1. Does there exist a triangle with sides 𝑎, 𝑏, 𝑐 such that?
𝑎+𝑏+𝑐 =6
a) �𝑎2 + 𝑏 2 + 𝑐 2 = 13.
𝑎3 + 𝑏 3 + 𝑐 3 = 28
𝑎+𝑏+𝑐 =6
b) �𝑎2 + 𝑏 2 + 𝑐 2 = 13.
𝑎3 + 𝑏 3 + 𝑐 3 = 30
Problem 12.2. Assume that each point of the plane is colored either in
red or in yellow. Prove that there exists a convex pentagon with three
right angles such that all its vertices are colored with the same color.
Problem 12.3. Let 𝑎, 𝑏, 𝑐, 𝑑 be non-negative real numbers such that
𝑎2 + 𝑏 2 + 𝑐 2 + 𝑑2 = 1.
Prove the inequality
𝑎 + 𝑏 + 𝑐 + 𝑑 − 1 ≥ 16𝑎𝑏𝑐𝑑.
When does the equality occur?
Problem 12.4. Let 𝐴𝐵𝐶 be an acute triangle with circumcircle 𝜔. Let 𝐷
be the foot of the perpendicular from 𝐴 to 𝐵𝐶. Let 𝐸 and 𝐹 be the
midpoints of the sides 𝐴𝐵 and 𝐴𝐶, respectively. Let 𝑃 and 𝑄 be the
second points of intersection of 𝜔 with the circumscribed circles of
triangles 𝐵𝐷𝐸 and 𝐶𝐷𝐹, respectively. Assume that the points 𝐴, 𝑃, 𝐵, 𝑄
and 𝐶 are on that order on 𝜔. Show that the lines 𝐸𝐹, 𝐵𝑄 and 𝐶𝑃 are
concurrent.
Problem 12.5. Find all positive integers 𝑥, 𝑦 such that 2𝑥 + 19𝑦 is a
perfect cube.

5
 2. IMO Test Selection Team - Problems
Problem T1. There are 2019 cards in a box. Each card has a number
written on one side and a letter on the other. Two students, Ana and
Ben, play a game: Ana gets all 2019 cards and places them in a line (in
some of them numbers are visible and in some others letters are
visible). Then, Ben applies the following procedure not more than 2019
times: he touches a card and that card together with its neighboring
cards are flipped (if in the beginning numbers appear on the card, after
applying the procedure letters appear and the other way around). Ben
wins the game if he can turn all cards on the side of letters, otherwise
Ana wins. Which of them has a strategy to win the game?
Problem T2. Find all functions 𝑓: ℝ → ℝ such that for all 𝑥, 𝑦 ∈ ℝ
𝑓(𝑥 4 − 𝑦 4 ) + 4𝑓(𝑥𝑦)2 = 𝑓(𝑥 4 + 𝑦 4 ).
Problem T3. Prove that there are infinitely many positive integers 𝑛
such that
4𝑛 + 2𝑛 + 1
𝑛2 + 𝑛 + 1
is a positive integer.
Problem T4. The rectangle 𝐴𝐵𝐶𝐷 is given. Let 𝐸 be the midpoint of the
side 𝐷𝐴. On the line passing through 𝐸 parallel to 𝐴𝐵 the point 𝐹 is
chosen so that that 𝐸 and 𝐹 are on different sides of the line 𝐵𝐶 and the
area of triangle 𝐶𝐸𝐹 is
1 𝐵𝐶 3
𝑆(𝐶𝐸𝐹) = � + 4𝐴𝐵 ⋅ 𝐵𝐶� .
16 𝐴𝐵
The point 𝐺 is chosen in the diagonal 𝐴𝐶 such that the triangles 𝐴𝐸𝐶 and
𝐴𝐺𝐸 are similar. The point 𝐻 is the foot of the perpendicular from 𝐸 to
𝐹𝐷. Let 𝑋 and 𝑌 be the intersection points of the lines 𝐵𝐻 with 𝐺𝐸 and
𝐶𝐴 with 𝐻𝐸, respectively. Prove that 𝑋𝑌 ⊥ 𝐴𝐵.
Problem T5. Let 𝑎, 𝑏, 𝑐, 𝑑 be fixed positive real numbers. Find the
maximal value of the function 𝑓: ℝ+
0 → ℝ defined as
𝑎 + 𝑏𝑥 𝑏 + 𝑐𝑥 𝑐 + 𝑑𝑥 𝑑 + 𝑎𝑥
𝑓(𝑥) = + + + , ∀𝑥 ≥ 0.
𝑏 + 𝑐𝑥 𝑐 + 𝑑𝑥 𝑑 + 𝑎𝑥 𝑎 + 𝑏𝑥
6
 3. Final Round – National Competitions - Solutions
Grade 9

Problem 9.1. We use the fact (𝑛 + 1)2 − 𝑛2 = 2𝑛 + 1 = 𝑛 + (𝑛 + 1) and

𝑛(𝑛+1)
the well-known formula 1 + 2 + ⋯ + 𝑛 = 2 to obtain:

12 − 22 + 32 − 42 + ⋯ − 20182 + 20192
= 12 + (32 − 22 ) + ⋯ + (20192 − 20182 )
2019⋅2020
= 1 + 2 + 3 + ⋯ + 2018 + 2019 = = 2039190.
2

Problem 9.2. Let 𝑛, 𝑛 + 1, 𝑛 + 2 be three positive integers. Their

product is equal to 𝑛(𝑛 + 1)(𝑛 + 2) while their arithmetic mean equals
𝑛+(𝑛+1)+(𝑛+2)
3
.

Therefore we have
𝑛 + (𝑛 + 1) + (𝑛 + 2) 3(𝑛 + 1)
𝑛(𝑛 + 1)(𝑛 + 2) + = 𝑛(𝑛 + 1)(𝑛 + 2) +
3 3
2 3
= (𝑛 + 1)(𝑛(𝑛 + 2) + 1) = (𝑛 + 1)(𝑛 + 2𝑛 + 1)(𝑛 + 1) .

Problem 9.3. Let 𝐺 be the intersection point of segments 𝐵𝐸 and 𝐴𝐶.

From right-angle triangles 𝐴𝐵𝐶, 𝐵𝐺𝐶 and 𝐵𝐶𝐸 we have
∠𝐵𝐴𝐶 = 90∘ − ∠𝐵𝐶𝐴 = 90∘ − ∠𝐵𝐶𝐺 = ∠𝐶𝐵𝐺 = ∠𝐶𝐵𝐸.
Also ∠𝐸𝐶𝐵 = ∠𝐶𝐵𝐴 = 90∘ , therefore ∆𝐸𝐶𝐵 ≅ ∆𝐶𝐵𝐴
which implies that
𝐶𝐸 𝐵𝐶 𝐴𝐵 𝐵𝐶
= ⇒ = ⇒ (𝐴𝐵)2 = 2(𝐵𝐶)2 ⇒ 𝐴𝐵 =
𝐵𝐶 𝐴𝐵 2𝐵𝐶 𝐴𝐵
√2𝐵𝐶.
Using the Pythagorean Theorem in the isosceles right-angle triangle
𝐵𝐶𝐹 we have
𝐵𝐹 2 = 𝐵𝐶 2 + 𝐶𝐹 2 = 2𝐵𝐶 2 ⇒ 𝐵𝐹 = √2𝐵𝐶 = 𝐴𝐵.

7
Problem 9.4. Let 𝑛, 𝑛 + 𝑘 be the smallest and the largest positive
integers of the sequence, respectively. The condition of the problem
gives
(𝑘 + 1)(2𝑛 + 𝑘)
𝑛 + (𝑛 + 1) + ⋯ + (𝑛 + 𝑘) = = 2019
2
which is equivalent to
(𝑘 + 1)(2𝑛 + 𝑘) = 2 ⋅ 3 ⋅ 673
where 2, 3, 673 are prime numbers.
Since 2𝑛 + 𝑘 > 𝑘 + 1 we have the following cases 𝑘 + 1 ∈ {2, 3, 6} ⇒
𝑘 ∈ {1, 2, 5}.
If 𝑘 = 1 we have 2𝑛 + 1 = 2019 ⇒ 𝑛 = 1009, yielding the sequence
1009, 1010.
If 𝑘 = 2 we have 2𝑛 + 2 = 1346 ⇒ 𝑛 = 672, yielding the sequence
672, 673, 674.
If 𝑘 = 5 we have 2𝑛 + 5 = 673 ⇒ 𝑛 = 334, yielding the sequence
334, 335, 336, 337, 338, 339.

Problem 9.5. We delete the numbers 3, 5, 7, 8, 10, 12, 14, 15, 16. The
remaining numbers in the table are 1, 2, 4, 6, 9, 11, 13, 17, 18. It is easy to
verify that the sum any two of them is not a perfect square.
Thus, it is possible to delete 9 numbers.
Next, we show that we have to delete at least 9 numbers.
Consider the following pairs of integers
(18, 7), (17, 8), (16, 9), (15, 1), (14, 2), (13, 3), (12, 4), (11, 5), (10, 6).
Since all the above pairs are disjoint with each other and the sum of
numbers in each pair is a perfect square, we have to delete at least one
number from each pair. Thus we have to delete at least 9 numbers from
the blackboard.
As we have found a configuration for 9 numbers, we conclude that the
minimum numbers needed to be deleted is 9.

8
 Grade 10

Problem 10.1. We have

2019! 2019 ⋅ 2018 ⋅ … ⋅ 2 ⋅ 1
=
21009 21009
2019 ⋅ 2017 ⋅ … ⋅ 3 ⋅ 1 ⋅ 2018 ⋅ 2016 ⋅ … ⋅ 4 ⋅ 2
=
21009
2019 ⋅ 2017 ⋅ … ⋅ 3 ⋅ 1 ⋅ (2 ⋅ 1009) ⋅ (2 ⋅ 1008) ⋅ … ⋅ (2 ⋅ 2) ⋅ (2 ⋅ 1)
=
21009
2019 ⋅ 2017 ⋅ … ⋅ 3 ⋅ 1 ⋅ 21009 ⋅ 1009 ⋅ 1008 ⋅ … ⋅ 2 ⋅ 1
=
21009
= 2019 ⋅ 2017 ⋅ … ⋅ 3 ⋅ 1 ⋅ 1009 ⋅ 1008 ⋅ … ⋅ 2 ⋅ 1.
Since this number has the number 1000 as a factor, then its last three
digits are 000.

Problem 10.2. The given inequality is equivalent to

4(𝑎3 + 𝑏 3 + 𝑐 3 + 3) ≥ 3(𝑎𝑏𝑐 + 𝑎𝑏 + 𝑏𝑐 + 𝑐𝑎 + 𝑎 + 𝑏 + 𝑐 + 1)
⇔ 4(𝑎3 + 𝑏 3 + 𝑐 3 ) + 9 ≥ 3(𝑎𝑏𝑐 + 𝑎𝑏 + 𝑏𝑐 + 𝑐𝑎 + 𝑎 + 𝑏 + 𝑐).
To show the previous inequality we use the Arithmetic-Geometric mean
and add the following inequalities:
3
𝑎3 + 𝑏 3 + 𝑐 3 ≥ 3 �𝑎3 ⋅ 𝑏 3 ⋅ 𝑐 3 = 3𝑎𝑏𝑐
3
𝑎3 + 𝑏 3 + 1 ≥ 3 �𝑎3 ⋅ 𝑏 3 ⋅ 1 = 3𝑎𝑏
3
𝑏 3 + 𝑐 3 + 1 ≥ 3 �𝑏 3 ⋅ 𝑐 3 ⋅ 1 = 3𝑏𝑐
3
𝑐 3 + 𝑎3 + 1 ≥ 3 �𝑐 3 ⋅ 𝑎3 ⋅ 1 = 3𝑐𝑎
3
𝑎3 + 1 + 1 ≥ 3 �𝑎3 ⋅ 1 ⋅ 1 = 3𝑎
3
𝑏 3 + 1 + 1 ≥ 3 �𝑏 3 ⋅ 1 ⋅ 1 = 3𝑏
3
𝑐 3 + 1 + 1 ≥ 3√𝑎3 ⋅ 1 ⋅ 1 = 3𝑐.

9
From 𝑎3 + 𝑏 3 + 𝑐 3 ≥ 3𝑎𝑏𝑐 we conclude that equality occurs if and only
if 𝑎 = 𝑏 = 𝑐.
From 𝑎3 + 1 + 1 ≥ 3𝑎 we conclude that equality occurs if and only if
𝑎 = 1.
Therefore the equality is attained if and only if 𝑎 = 𝑏 = 𝑐 = 1.
Substituting these values we confirm the equality.

Problem 10.3. Let 𝑡𝑘 denote the sum of pills the patient takes from the
first day up to the day 𝑘, where 𝑘 = 1,2, … ,30. Clearly
0 < 𝑡1 < 𝑡2 < ⋯ < 𝑡30 = 48. (1)
We add 11 to each member in (1) and obtain
11 < 𝑡1 + 11 < 𝑡2 + 11 < ⋯ < 𝑡30 + 11 = 59.
Now, there are 60 numbers and the largest of them is 59. By the
Pigeonhole Principle, two of the numbers should be equal.
Since in the first relation there are no two such numbers (due to
definition of 𝑡𝑘 ), two such numbers do not exist neither in the second
relation. Therefore, there exists positive integers 1 ≤ 𝑖 ≠ 𝑗 ≤ 30 such
that 𝑡𝑖 = 𝑡𝑗 + 11.
Since, in each day, he can not take more than 6 pills, we conclude that he
can not have 11 pills for a day, which implies that in some consecutive
days the total number of pills he takes equals 11.

Problem 10.4. From the system we obtain following conditions

𝑥 3 − 𝑦 ≥ 0; 𝑧 ≥ 1
� 𝑦 3 − 𝑧 ≥ 0; 𝑥 ≥ 1 .
𝑧 3 − 𝑥 ≥ 0; 𝑦 ≥ 1
Squaring the equations of the given system gives
𝑥 3 − 𝑦 = 𝑧 2 − 2𝑧 + 1
�𝑦 3 − 𝑧 = 𝑥 2 − 2𝑥 + 1.
𝑧 3 − 𝑥 = 𝑦 2 − 2𝑦 + 1
Adding those equations side by side yields:

10
 𝑥 3 + 𝑦 3 + 𝑧 3 − 𝑥 − 𝑦 − 𝑧 = 𝑥 2 + 𝑦 2 + 𝑧 2 − 2𝑥 − 2𝑦 − 2𝑧 + 3
⇒ (𝑥 2 + 1)(𝑥 − 1) + (𝑦 2 + 1)(𝑦 − 1) + (𝑧 2 + 1)(𝑧 − 1) = 0.
If any of the numbers 𝑥, 𝑦, 𝑧 is greater than 1 we would have
(𝑥 2 + 1)(𝑥 − 1) + (𝑦 2 + 1)(𝑦 − 1) + (𝑧 2 + 1)(𝑧 − 1) > 0
which clearly is not possible, thus the only remaining possibility is
𝑥 = 𝑦 = 𝑧 = 1.
Substituting in the initial equations, we notice that this is the only
solution of the equations, as the both sides of equation are equal to 0.

Problem 10.5. Let 𝐼 be the intersection point of

segments 𝐸𝐹 and 𝐴𝐷. Since 𝐴𝐵𝐶𝐷𝐸 is regular
pentagon we have that 𝐸𝐹 bisects the segment
𝐴𝐷, thus 𝐴𝐼 = 𝐷𝐼.
Since 𝐵𝐷||𝐸𝐴 and 𝐴𝐶||𝐷𝐸 it follows that 𝐷𝐹||𝐸𝐴
and 𝐹𝐴||𝐷𝐸. Thus quadrilateral 𝐴𝐹𝐷𝐸 is a
parallelogram and since 𝐴𝐼 = 𝐷𝐼 one obtains
𝐸𝐼 = 𝐹𝐼 ⇒ 𝐸𝐹 = 2𝐼𝐹.
From the condition of the problem we find
2𝐴𝐷 = 3𝐴𝐺 ⇒ 2(𝐴𝐼 + 𝐼𝐺 + 𝐷𝐺) = 3(𝐴𝐼 + 𝐼𝐺)
⇒ 2𝐷𝐺 = 𝐴𝐼 + 𝐼𝐺 = 𝐷𝐼 + 𝐼𝐺 = 𝐷𝐺 + 2𝐼𝐺 ⇒ 𝐷𝐺 = 2𝐼𝐺.
Since 𝐻 is the midpoint of side 𝐷𝐸 we get 𝐷𝐻 = 𝐸𝐻. From these
relations in the triangle 𝐸𝐼𝐷 holds:
𝐸𝐹 𝐼𝐺 𝐷𝐻 2𝐼𝐹 𝐼𝐺 𝐸𝐻
⋅ ⋅ = ⋅ ⋅ = 1.
𝐼𝐹 𝐷𝐺 𝐸𝐻 𝐼𝐹 2𝐼𝐺 𝐸𝐻
Since points 𝐷, 𝐺 are on the sides 𝐼𝐷, 𝐷𝐸, respectively and 𝐹 is on the
line 𝐸𝐼 with ordering of points 𝐸, 𝐼, 𝐹, from the Menelaus Theorem we
conclude that points 𝐹, 𝐺, 𝐻 are collinear.

11
 Grade 11

Problem 11.1. Let 𝐷1 , 𝐷2 denote the discriminants of quadratic

trinomials 𝑥 2 + 𝑎𝑥 + 𝑏, 𝑥 2 + 𝑏𝑥 + 𝑎, respectively. If none of these
quadratic trinomials has two different real roots we would have 𝐷1 ≤ 0
and 𝐷2 ≤ 0.
Since 𝐷1 = 𝑎2 − 4𝑏 and 𝐷2 = 𝑏 2 − 4𝑎 thus 𝑎2 ≤ 4𝑏 and 𝑏 2 ≤ 4𝑎.
However, because both numbers 𝑎, 𝑏 are greater than 4, then
4𝑎 < 𝑎2 ≤ 4𝑏 ⇒ 𝑎 < 𝑏 and 4𝑏 < 𝑏 2 ≤ 4𝑎 ⇒ 𝑏 < 𝑎, which is a
contradiction.
Thus either 𝐷1 > 0 or 𝐷2 > 0, which means that at least one of the
quadratic equations has two different real roots.

Problem 11.2. We first test the problems for some small values of 𝑛.
For 𝑛 = 1 we have 61 + 1 = 7 which satisfies the condition of the
problem.
For 𝑛 = 2 we have 62 + 1 = 37 which does not meet the condition of the
problem.
For 𝑛 = 3 we have 63 + 1 = 217 which does not meet the condition of
the problem.
For 𝑛 = 4 we have 64 + 1 = 1297 which does not meet the condition of
the problem.
Further let 𝑛 ≥ 5. We easily notice that
6𝑛 ≡ 6(𝑚𝑜𝑑 10) ⇒ 6𝑛 + 1 ≡ 7(𝑚𝑜𝑑 10)
thus the last digit should be 7, and consecutively all the digits should be
7.
Let us denote with 𝑚 the number of digits of the number 6𝑛 + 1 . We
have:
10𝑚 − 1
77
��� … 7 = 7 ⋅ ��������
6𝑛 + 1 = �������� 11
��� …1 = 7 ⋅ � � ⇒ 9(6𝑛 + 1) = 7(10𝑚 − 1)
𝑚 𝑚
9
⇒ 9 ⋅ 6𝑛 + 9 = 7 ⋅ 10𝑚 − 7 ⇒ 9 ⋅ 6𝑛 + 16 = 7 ⋅ 10𝑚

12
 ⇒ 16(2𝑛−4 ⋅ 3𝑛+2 + 1) = 7 ⋅ 2𝑚 ⋅ 5𝑚 .
Since 2𝑛−4 ⋅ 3𝑛+2 + 1 is an odd number then 24 ||2𝑚 thus 𝑚 = 4. It yields
that
2𝑛−4 ⋅ 3𝑛+2 + 1 = 7 ⋅ 54 = 4375 ⇒ 2𝑛−4 ⋅ 3𝑛+2 = 4374 = 2 ⋅ 37
⇒ 2𝑛−5 ⋅ 3𝑛−5 = 1 ⇒ 6𝑛−5 = 1 = 60 ⇒ 𝑛 − 5 = 0 ⇒ 𝑛 = 5 ,
so 𝑛 = 5 is also a solution since 65 + 1 = 7777. Therefore 𝑛 ∈ {1,5}.

Problem 11.3. Since the angle bisectors of a triangle meet at a point,

which is the incenter of that triangle, we have that the point 𝐼 is the
intersection of the lines 𝐵𝐷 and 𝐶𝐸.
Let 𝛽 and 𝛾 denote angles in vertices 𝐵 and 𝐶,
respectively. We have 60∘ + 𝛽 + 𝛾 = 180∘ so
𝛽 + 𝛾 = 120∘.
Since ∠𝐵𝐼𝐶 + ∠𝐼𝐶𝐵 + ∠𝐶𝐵𝐼 = 180∘ we have that
γ+β
∠𝐵𝐼𝐶 = 180∘ − ∠𝐼𝐶𝐵 − ∠𝐶𝐵𝐼 = 180∘ − = 180∘ − 60∘ = 120∘ .
2

Therefore ∠𝐵𝐼𝐸 = 180∘ − ∠𝐵𝐼𝐶 = 180∘ − 120∘ = 60∘ .

Since ∠𝐵𝐴𝐷 = ∠𝐵𝐼𝐸 = 60∘ and ∠𝐷𝐵𝐴 = ∠𝐸𝐵𝐼 we conclude that
𝐵𝐷 𝐵𝐴
∆𝐵𝐴𝐷 ≅ ∆𝐵𝐼𝐸, so = which gives that ∆𝐵𝐷𝐸 ≅ ∆𝐵𝐴𝐼, so
𝐵𝐸 𝐵𝐼
∠𝐵𝐷𝐸 = ∠𝐵𝐴𝐼.
∠𝐶𝐴𝐵
Since 𝐼 is the incenter we have that ∠𝐵𝐴𝐼 = = 30∘ .
2

Therefore ∠𝐼𝐷𝐸 = ∠𝐵𝐷𝐸 = ∠𝐵𝐴𝐼 = 30∘ .

In a similar way we find that ∠𝐼𝐸𝐷 = 30∘ which shows that for triangle
𝐼𝐷𝐸 holds ∠𝐼𝐷𝐸 = ∠𝐼𝐸𝐷 = 30∘ therefore the triangle is isosceles with
𝐼𝐷 = 𝐼𝐸, which completes the proof.

Problem 11.4. Let us denote the initial condition with 𝑃(𝑥, 𝑦). We let
𝑃(𝑥, 0) and have:
𝑓�𝑓(𝑥)� = 𝑥𝑓(0). (1)
Case 1. 𝑓(0) = 0.

13
From (1) we have 𝑓�𝑓(𝑥)� = 0. From the last expression and the initial
condition we have that:
𝑓�𝑥𝑓(𝑦)� = 𝑓 �𝑓�𝑥𝑦 + 𝑓(𝑥)�� = 0.

Then we obtain 𝑓(𝑥) = 0 ∀𝑥 ∈ ℝ, if there exist 𝑢 ∈ ℝ such that

𝑢
𝑓(𝑢) ≠ 0 and since 𝑓�𝑥𝑓(𝑦)� = 0 ∀𝑥, 𝑦 ∈ ℝ by setting 𝑥 = and
𝑓(𝑢)
𝑦 = 𝑢 in the last relation we get 𝑓(𝑢) = 0, which is not possible.
Case 2. 𝑓(0) ≠ 0.
From (1) we find that the function is injective. Indeed,
𝑓(𝑥1 ) = 𝑓(𝑥2 ) ⇒ 𝑓�𝑓(𝑥1 )� = 𝑓�𝑓(𝑥2 )� ⇒ 𝑥1 𝑓(0) = 𝑥2 𝑓(0) ⇒ 𝑥1 = 𝑥2 .
From 𝑃(𝑓(𝑥), 𝑦) and (1) we have:

𝑓 �𝑓(𝑥)𝑦 + 𝑓�𝑓(𝑥)�� = 𝑓(𝑥)𝑓(𝑦) ⇒ 𝑓�𝑓(𝑥)𝑦 + 𝑥𝑓(0)� = 𝑓(𝑥)𝑓(𝑦).

Switching 𝑥, 𝑦 with each other in the last relation gives:

𝑓�𝑓(𝑦)𝑥 + 𝑦𝑓(0)� = 𝑓(𝑦)𝑓(𝑥).
From the last two relations and injectivity we have
𝑓�𝑓(𝑥)𝑦 + 𝑥𝑓(0)� = 𝑓�𝑓(𝑦)𝑥 + 𝑦𝑓(0)�
⇒ 𝑓(𝑥)𝑦 + 𝑥𝑓(0) = 𝑓(𝑦)𝑥 + 𝑦𝑓(0).
Taking 𝑦 = 1 in the last relation gives:
𝑓(𝑥) + 𝑥𝑓(0) = 𝑓(1)𝑥 + 𝑓(0) ⇒ 𝑓(𝑥) = �𝑓(1) − 𝑓(0)�𝑥 + 𝑓(0).
Therefore 𝑓(𝑥) = 𝑎𝑥 + 𝑏 ∀𝑥 ∈ ℝ.
We find the values of constants for which the condition holds.
𝑓�𝑥𝑦 + 𝑓(𝑥)� = 𝑥𝑓(𝑦) ⇒ 𝑓(𝑥𝑦 + 𝑎𝑥 + 𝑏) = 𝑥(𝑎𝑦 + 𝑏)
⇒ 𝑎𝑥𝑦 + 𝑎2 𝑥 + 𝑎𝑏 + 𝑏 = 𝑎𝑥𝑦 + 𝑏𝑥 ⇒ (𝑎2 − 𝑏)𝑥 + 𝑏(𝑎 + 1) = 0.
Since it should hold for all 𝑥, 𝑦 ∈ ℝ we have that 𝑎2 − 𝑏 = 0 and
𝑏(𝑎 + 1) = 0.
Since 𝑏 = 𝑓(0) ≠ 0 we have 𝑎 = −1 which gives 𝑏 = 𝑎2 = (−1)2 = 1.
Therefore the function
14
 𝑓(𝑥) = 1 − 𝑥 , ∀𝑥 ∈ ℝ
satisfies the condition of the problem.
We conclude that the functions satisfying the condition are:
𝑓(𝑥) = 0, ∀𝑥 ∈ ℝ ∨ 𝑓(𝑥) = 1 − 𝑥, ∀𝑥 ∈ ℝ.

Problem 11.5. All possible distances from one point to another are:
1, 2, 3, √2, √5, √8, √10, √13, √18. It is clear that the rectangles formed
from those points having positive integer sides are only those rectangles
whose sides are parallel to axes Ox and Oy.
We show that there is strategy for Agon to
win the game. Since Agon plays first, in his
first three moves, he always can color one
red point to be in the same line or column
with one yellow point.
It is clear that if two columns/rows switch
places with each other then the
configuration does not change, since in
this case the rectangle with positive
integer sides maps again to a rectangle.
Therefore we can assume that the first three moves are done as follows:
first move: coordinate (1,4) – colored in red; second move: coordinate
(3,3) – colored in yellow; third move:
coordinate (1,3) – colored in red.
Since the second column, fourth column,
third row and fourth row, for the time
being have no colored point, it is ensured
that in the fourth move at least one of the
columns and one of the rows is not yet
colored.
We can assume that the second column
and third row have no colored point. Next,
we consider the configuration in two

15
cases, when in the fourth move either coordinate (4,3) or (4,4) is
colored in yellow and when in the fourth move coordinates (4,3) and
(4,4) are not colored in yellow.
Case 1. In the fourth move either coordinate (4,3) or coordinate (4,4) is
colored in yellow.
Without loss of generality, we may assume that coordinate (4,3) is
colored in yellow. In the fifth move the coordinate (2,3) is colored in
red. After, fifth move, Ben will be forced to color points such that Agon
cannot make a rectangle with positive integer sides. The game continues
as it is described in the following configuration.
Note that in the thirteenth move, Agon will color either coordinate (3,1)
or coordinate (3,3) in red in order to form rectangle with positive
integers, depending on Ben’s twelfth move.
Case 2. In the fourth move coordinates (4,3) and (4,4) are not colored in
yellow.
Without loss of generality, we may assume that coordinate (1,1) is
colored in yellow. In the fifth move the coordinate (2,3) is colored in
red. After the fifth move, Ben will be forced to color points such that
Agon can not make a rectangle with positive integer sides. The game
continues as it is described in the following configuration.
Note that in the eleventh move Agon will color either coordinate (4,2) or
(4,4) in red in order to form rectangle with positive integer sides with
red vertices, depending on the Ben’s tenth move.

Grade 12

Problem 12.1. a) No, it does not exist. In fact, even there are no real
positive numbers a, b, c, satisfying those relations. If such a triple would
exist, then from the Cauchy inequality one would have
(𝑎3 + 𝑏 3 + 𝑐 3 )(𝑎 + 𝑏 + 𝑐) ≥ (𝑎2 + 𝑏 2 + 𝑐 2 )2 ⇒ 28 ⋅ 6 ≥ 132 ⇒ 168
≥ 169
which is not possible.
b) Yes, it does. We find the values of expressions 𝑎𝑏 + 𝑏𝑐 + 𝑐𝑎 and 𝑎𝑏𝑐.
16
 (𝑎 + 𝑏 + 𝑐)2 − 𝑎2 − 𝑏 2 − 𝑐 2 23
𝑎𝑏 + 𝑏𝑐 + 𝑐𝑎 = =
2 2
3 3 3 2 2 2
𝑎 + 𝑏 + 𝑐 − (𝑎 + 𝑏 + 𝑐)(𝑎 + 𝑏 + 𝑐 − 𝑎𝑏 − 𝑏𝑐 − 𝑐𝑎)
𝑎𝑏𝑐 = = 7.
3
Thus we have
𝑎+𝑏+𝑐 =6
23
�𝑎𝑏 + 𝑏𝑐 + 𝑐𝑎 = . 2
𝑎𝑏𝑐 = 7
From Vieta’s formula we have that 𝑎, 𝑏, 𝑐 are roots of the equation
4𝑥 3 − 24𝑥 2 + 46𝑥 − 28 = 0.
Note that 𝑥 = 2 is one solution of above equation, thus we can write
(𝑥 − 2)(4𝑥 2 − 16𝑥 + 14) = 0 ⇒ (𝑥 − 2)�2𝑥 − 4 + √2��2𝑥 − 4 − √2�.
√2 √2
Thus numbers 𝑎, 𝑏, 𝑐 are 2 − 2
, 2,2 + 2 in some order. We assume that
√2 √2
𝑎 =2− , 𝑏 = 2 and 𝑐 = 2+ 2.
2

It is clear that those numbers are positive and 𝑏 + 𝑐 > 𝑎, 𝑐 + 𝑎 > 𝑏. We

√2
show that 𝑎 + 𝑏 > 𝑐, which is in fact equivalent to 2 − 2
+2 >2+
√2
⇔ 2 > √2, and which is true.
2

Problem 12.2. In the coordinative system, consider the points (𝑖, 𝑗)

with positive integer coordinates 1 ≤ 𝑖 ≤ 65 and 1 ≤ 𝑗 ≤ 5. In total
there are 325 points. We take five points (𝑖, 1), (𝑖, 2), (𝑖, 3), (𝑖, 4), (𝑖, 5)
where 1 ≤ 𝑖 ≤ 65.
Since, given two colors, five different
points can be colored in 25 = 32 ways
and since 65 = 2 ⋅ 32 + 1, from the
Pigeonhole principle there exist positive
integers 1 ≤ 𝑖 ≠ 𝑗 ≠ 𝑘 ≠ 𝑖 ≤ 65 such
that points (𝑖, 1), (𝑖, 2), (𝑖, 3), (𝑖, 4), (𝑖, 5)
and (𝑗, 1), (𝑗, 2), (𝑗, 3), (𝑗, 4), (𝑗, 5) and (𝑘, 1), (𝑘, 2), (𝑘, 3), (𝑘, 4), (𝑘, 5) are
colored with same colors in that order.
17
Since each point is colored with one of the two given colors and since
(𝑖, 1), (𝑖, 2), (𝑖, 3), (𝑖, 4), (𝑖, 5) are five points and since 5 = 2 ⋅ 2 + 1 from
the Pigeonhole Principle, there exist three points with the same color.
Without loss of generality we assume that points (𝑖, 1), (𝑖, 2), (𝑖, 3) are
colored in red, and consecutively also the points (𝑗, 1), (𝑗, 2), (𝑗, 3) and
(𝑘, 1), (𝑘, 2), (𝑘, 3) are colored in red.
Let 𝐴, 𝐵, 𝐶, 𝐷, 𝐸, 𝐹, 𝐺, 𝐻, 𝐼 denote those points, whose configuration is
given in the figure.
Now the pentagon 𝐴𝐺𝐼𝐹𝐵 satisfies the conditions of the problem since
all its vertices are in red and also ∠𝐵𝐴𝐺 = ∠𝐴𝐺𝐼 = ∠𝐺𝐼𝐹 = 90∘ .

Problem 12.3. The inequality is equivalent to

𝑎 + 𝑏 + 𝑐 + 𝑑 ≥ 1 + 16𝑎𝑏𝑐𝑑 ⇔ (𝑎 + 𝑏 + 𝑐 + 𝑑)2 ≥ (1 + 16𝑎𝑏𝑐𝑑)2 ⇔
𝑎2 + 𝑏 2 + 𝑐 2 + 𝑑2 + 2(𝑎𝑏 + 𝑏𝑐 + 𝑐𝑑 + 𝑑𝑎 + 𝑎𝑐 + 𝑏𝑑) ≥ (1 + 16𝑎𝑏𝑑)2 .
Using the condition of the problem we see that the inequality is
equivalent to:
1 + 2(𝑎𝑏 + 𝑏𝑐 + 𝑐𝑑 + 𝑑𝑎 + 𝑎𝑐 + 𝑏𝑑) ≥ 1 + 32𝑎𝑏𝑐𝑑 + 256(𝑎𝑏𝑐𝑑)2 ⇔
2(𝑎𝑏 + 𝑏𝑐 + 𝑐𝑑 + 𝑑𝑎 + 𝑎𝑐 + 𝑏𝑑) ≥ 32𝑎𝑏𝑐𝑑 + 256(𝑎𝑏𝑐𝑑)2 ⇔
𝑎𝑏 + 𝑏𝑐 + 𝑐𝑑 + 𝑑𝑎 + 𝑎𝑐 + 𝑏𝑑 ≥ 16𝑎𝑏𝑐𝑑 + 128(𝑎𝑏𝑐𝑑)2 .
From Arithmetic-Geometric mean we obtain
6
𝑎𝑏 + 𝑏𝑐 + 𝑐𝑑 + 𝑑𝑎 + 𝑎𝑐 + 𝑏𝑑 ≥ 6�(𝑎𝑏𝑐𝑑)3 = 6√𝑎𝑏𝑐𝑑.
Thus it is sufficient to show that
6√𝑎𝑏𝑐𝑑 ≥ 16𝑎𝑏𝑐𝑑 + 128(𝑎𝑏𝑐𝑑)2 ⇔ 3√𝑎𝑏𝑐𝑑 ≥ 8𝑎𝑏𝑐𝑑 + 64(𝑎𝑏𝑐𝑑)2 .
Substituting 𝑎𝑏𝑐𝑑 = 𝑡 2 such that 𝑡 ≥ 0 the inequality is transformed as
3𝑡 ≥ 8𝑡 2 + 64𝑡 4 ⇔ 64𝑡 4 + 8𝑡 2 − 3𝑡 ≤ 0 ⇔ 𝑡(4𝑡 − 1)(16𝑡 2 + 4𝑡 + 3)
≤ 0.
Therefore it is sufficient to show that 4𝑡 ≤ 1.
From the condition of the problem and Arithmetic-Geometric mean we
have

18
 4 4
1 = 𝑎2 + 𝑏 2 + 𝑐 2 + 𝑑2 ≥ 4�(𝑎𝑏𝑐𝑑)2 = 4 �𝑡 4 = 4𝑡
which completes the proof.
Next we show when the equality occurs. From Arithmetic-Geometric
mean
𝑎𝑏 + 𝑏𝑐 + 𝑐𝑑 + 𝑑𝑎 + 𝑎𝑐 + 𝑏𝑑 = 6√𝑎𝑏𝑐𝑑
is possible if and only if when
𝑎𝑏 = 𝑏𝑐 = 𝑐𝑑 = 𝑑𝑎 = 𝑎𝑐 = 𝑏𝑑
as well as 𝑡(4𝑡 − 1)(16𝑡 2 + 4𝑡 + 3) = 0 if and only if when 𝑡 = 0 or
1
𝑡 = . If 𝑡 = 0 we have that at least one of the numbers 𝑎, 𝑏, 𝑐, 𝑑 is equal
4
to 0. Let 𝑑 = 0, then from previous case we have that 𝑎𝑏 = 𝑏𝑐 = 𝑎𝑐 = 0
which gives that at least two of the numbers 𝑎, 𝑏, 𝑐 equal 0. Let
𝑏 = 𝑐 = 0, from the condition we have that 𝑎2 = 1 ⇒ 𝑎 = 1.
1
Next we consider the case when = , but from the Arithmetic-Geometric
4
mean this is possible if and only if when 𝑎 = 𝑏 = 𝑐 = 𝑑 and from the
1 1
condition that 4𝑎2 = 1 ⇒ 𝑎 = , thus 𝑎 = 𝑏 = 𝑐 = 𝑑 = . Therefore the
2 2
equality is attained if and only if
1 1 1 1
(𝑎, 𝑏, 𝑐, 𝑑) ∈ {(1,0,0,0), (0,1,0,0), (0,0,1,0), (0,0,0,1), � , , , �}.
2 2 2 2

Problem 12.4. Since quadrilateral

𝐴𝑃𝐵𝐶 is cyclic we have ∠𝐵𝑃𝐶 = ∠𝐵𝐴𝐶.
Since triangle 𝐴𝐷𝐵 is right triangle
with ∠𝐴𝐷𝐵 = 90∘ and since 𝐸 is the
midpoint of side 𝐴𝐵 we have that 𝐸 is
the center of circumscribed circle in
triangle, therefore 𝐸𝐷 = 𝐸𝐵 ⇒
∠𝐸𝐷𝐵 = ∠𝐸𝐵𝐷 = ∠𝐴𝐵𝐶.
Since quadrilateral 𝑃𝐵𝐷𝐸 is cyclic we
have that:
∠𝐸𝑃𝐵 = 180∘ − ∠𝐸𝐷𝐵 = 180∘ − ∠𝐴𝐵𝐶 ⇒ ∠𝐶𝑃𝐸 = ∠𝐵𝑃𝐸 − ∠𝐵𝑃𝐶
= 180∘ − ∠𝐴𝐵𝐶 − ∠𝐵𝐴𝐶 = ∠𝐵𝐶𝐴.

19
From the other side since 𝐸, 𝐹 are midpoints of sides 𝐴𝐵, 𝐴𝐶,
respectively, we have 𝐸𝐹||𝐵𝐶 thus ∠𝐶𝐹𝐸 = 180∘ − ∠𝐵𝐶𝐴 = 180∘ −
∠𝐶𝑃𝐸 therefore quadrilateral 𝑃𝐸𝐹𝐶 is cyclic. Let 𝜔1 denote the
circumcircle of this quadrilateral.
Since quadrilateral 𝐴𝐵𝑄𝐶 is cyclic we have ∠𝐵𝑄𝐶 = 180∘ − ∠𝐵𝐴𝐶, since
𝐴𝐷𝐶 is right angle triangle with ∠𝐴𝐷𝐶 = 90∘ and 𝐹 is midpoint of 𝐴𝐶
we have that 𝐹 is center of circumscribed circle in triangle 𝐴𝐷𝐶
therefore we have:
𝐹𝐷 = 𝐹𝐶 ⇒ ∠𝐶𝐷𝐹 = ∠𝐷𝐶𝐹 = ∠𝐵𝐶𝐴.
Since quadrilateral 𝐶𝐹𝐷𝑄 is cyclic we have ∠𝐶𝑄𝐹 = ∠𝐶𝐷𝐹 = ∠𝐵𝐶𝐴
⇒ 𝐵𝑄𝐹 = ∠𝐵𝑄𝐶 − ∠𝐶𝑄𝐹 = 180∘ − ∠𝐵𝐴𝐶 − ∠𝐵𝐶𝐴 = ∠𝐴𝐵𝐶.
From the other side since 𝐸, 𝐹 are midpoints of sides 𝐴𝐵, 𝐴𝐶,
respectively, we have 𝐸𝐹||𝐵𝐶 thus ∠𝐵𝐸𝐹 = 180∘ − ∠𝐴𝐵𝐶 = 180∘ −
∠𝐵𝑄𝐹 therefore quadrilateral 𝐵𝐸𝐹𝑄 is cyclic. Let 𝜔2 denote the
circumcircle of this quadrilateral.
Since the lines 𝐸𝐹, 𝐵𝑄 and 𝐶𝑃 are radical axes of circles 𝜔1 with 𝜔2 , 𝜔
with 𝜔2 and 𝜔1 with 𝜔, respectively and since 𝐶𝑃 ∦ 𝐵𝐶 ⇒ 𝐶𝑃 ∦ 𝐸𝐹
then from the radical axis theorem we have that the lines 𝐸𝐹, 𝐵𝑄 and 𝐶𝑃
concurrent.

Problem 12.5. Since 2𝑥 + 19𝑦 is a perfect cube there exists a positive

integer 𝑧 such that 2𝑥 + 19𝑦 = 𝑧 3 . Since
(3𝑚 + 𝑛)3 = 27𝑚3 + 27𝑚2 𝑛 + 9𝑚𝑛2 + 𝑛3 ≡ 𝑛3 (𝑚𝑜𝑑 9).
So 𝑧 3 ≡ 03 , 13 , 23 (𝑚𝑜𝑑 9) ⇒ 𝑧 3 ≡ 0,1,8(𝑚𝑜𝑑 9).
Since 2𝑥 + 19 𝑧 ≡ 2𝑥 + 1(𝑚𝑜𝑑 9) so 2𝑥 + 1 ≡ 0,1,8(𝑚𝑜𝑑 9) we have that
2𝑥 ≡ 0,7,8(𝑚𝑜𝑑 9). It is clear that it is not possible that 2𝑥 ≡ 0(𝑚𝑜𝑑 9)
therefore 2𝑥 ≡ 7,8(𝑚𝑜𝑑 9). Since
21 ≡ 2(𝑚𝑜𝑑 9) ∧ 22 ≡ 4(𝑚𝑜𝑑 9) ∧ 23 ≡ 8(𝑚𝑜𝑑 9)
24 ≡ 16(𝑚𝑜𝑑 9) ≡ 7(𝑚𝑜𝑑 9) ∧ 25 ≡ 32(𝑚𝑜𝑑 9) ≡ 5(𝑚𝑜𝑑 9)
26 ≡ 64(𝑚𝑜𝑑 9) ≡ 1(𝑚𝑜𝑑 9).
We have that 𝑜𝑟𝑑9 (2) = 6 and since 2𝑥 ≡ 7,8(𝑚𝑜𝑑 9) thus

20
𝑥 ≡ 3,4(𝑚𝑜𝑑 6). We distinguish two cases.
Case 1. 𝑥 ≡ 4(𝑚𝑜𝑑 6).
Since
03 ≡ 0(𝑚𝑜𝑑 19) ∧ 13 ≡ 1(𝑚𝑜𝑑 19)
23 ≡ 8(𝑚𝑜𝑑 19) ∧ 33 ≡ 27(𝑚𝑜𝑑 19) ≡ 8(𝑚𝑜𝑑 19)
43 ≡ 64(𝑚𝑜𝑑 19) ≡ 7(𝑚𝑜𝑑 19) ∧ 53 ≡ 125(𝑚𝑜𝑑 19) ≡ 11(𝑚𝑜𝑑 19)
63 ≡ 216(𝑚𝑜𝑑 9) ≡ 7(𝑚𝑜𝑑 19) ∧ 73 ≡ 343(𝑚𝑜𝑑 19) ≡ 1(𝑚𝑜𝑑 19)
83 ≡ 512(𝑚𝑜𝑑 19) ≡ 18(𝑚𝑜𝑑 19) ∧ 93 ≡ 729(𝑚𝑜𝑑 19) ≡ 7(𝑚𝑜𝑑 19)
103 ≡ −93 (𝑚𝑜𝑑 19) ≡ −7(𝑚𝑜𝑑 19) ≡ 12(𝑚𝑜𝑑 19)
113 ≡ −83 (𝑚𝑜𝑑 19) ≡ −18(𝑚𝑜𝑑 19) ≡ 1(𝑚𝑜𝑑 19)
123 ≡ −73 (𝑚𝑜𝑑 19) ≡ −1(𝑚𝑜𝑑 19) ≡ 18(𝑚𝑜𝑑 19)
133 ≡ −63 (𝑚𝑜𝑑 19) ≡ −7(𝑚𝑜𝑑 19) ≡ 12(𝑚𝑜𝑑 19)
143 ≡ −53 (𝑚𝑜𝑑 19) ≡ −11(𝑚𝑜𝑑 19) ≡ 8(𝑚𝑜𝑑 19)
153 ≡ −43 (𝑚𝑜𝑑 19) ≡ −7(𝑚𝑜𝑑 19) ≡ 12(𝑚𝑜𝑑 19)
163 ≡ −33 (𝑚𝑜𝑑 19) ≡ −8(𝑚𝑜𝑑 19) ≡ 11(𝑚𝑜𝑑 19)
173 ≡ −23 (𝑚𝑜𝑑 19) ≡ −8(𝑚𝑜𝑑 19) ≡ 11(𝑚𝑜𝑑 19)
183 ≡ −13 (𝑚𝑜𝑑 19) ≡ −1(𝑚𝑜𝑑 19) ≡ 18(𝑚𝑜𝑑 19).
Therefore we have 𝑧 3 ≡ 0,1,7,8,11,12,18(𝑚𝑜𝑑 19).
From the Fermat’s theorem we have that 218 ≡ 1(𝑚𝑜𝑑 19) and since
𝑥 ≡ 4(𝑚𝑜𝑑 6) ⇒ 𝑥 ≡ 4,10,16(𝑚𝑜𝑑 18).
Case 1.1. 𝑥 ≡ 4(𝑚𝑜𝑑 18)
2𝑥 + 19𝑦 ≡ 24 (𝑚𝑜𝑑 19) ≡ 16(𝑚𝑜𝑑 19).
Case 1.2. 𝑥 ≡ 10(𝑚𝑜𝑑 18)
2𝑥 + 19𝑦 ≡ 210 (𝑚𝑜𝑑 19) ≡ 32 ⋅ 32(𝑚𝑜𝑑 19) ≡ (−6) ⋅ (−6)(𝑚𝑜𝑑 19)
≡ 36(𝑚𝑜𝑑 19) ≡ 17(𝑚𝑜𝑑 19).
Case 1.3. 𝑥 ≡ 16(𝑚𝑜𝑑 18)

21
 2𝑥 + 19𝑦 ≡ 216 (𝑚𝑜𝑑 19) ≡ 256 ⋅ 256(𝑚𝑜𝑑 19) ≡ 9 ⋅ 9(𝑚𝑜𝑑 19)
≡ 81(𝑚𝑜𝑑 19) ≡ 5(𝑚𝑜𝑑 19).
Therefore 2𝑥 + 19𝑦 ≡ 5,16,17(𝑚𝑜𝑑 19) which is a contradiction
2𝑥 + 19𝑦 = 𝑧 3 .
Case 2. 𝑥 ≡ 3(𝑚𝑜𝑑 6).
There exists an odd positive integer 𝑡 such that 𝑥 = 3𝑡 then equations
transform as follows
23𝑡 + 19𝑦 = 𝑧 3 ⇒ 𝑧 3 − (2𝑡 )3 = 19𝑦 ⇒ (𝑧 − 2𝑡 )(𝑧 2 + 𝑧 ⋅ 2𝑡 + 4𝑡 ) = 19𝑦 .
It is clear that 𝑔𝑐𝑑(𝑧, 2𝑡 ) = 1 and 𝑔𝑐𝑑(𝑧 − 2𝑡 , 3) = 1 so
𝑔𝑐𝑑(𝑧 − 2𝑡 , 3𝑧 ⋅ 2𝑡 ) = 1 ⇒ 𝑔𝑐𝑑(𝑧 − 2𝑡 , (𝑧 − 2𝑡 )2 + 3𝑧 ⋅ 2𝑡 ) = 1
⇒ 𝑔𝑐𝑑(𝑧 − 2𝑡 , 𝑧 2 + 𝑧 ⋅ 2𝑡 + 4𝑡 ) = 1.
From the equation we have that 𝑧 − 2𝑡 = 1 dhe 𝑧 2 + 𝑧 ⋅ 2𝑡 + 4𝑡 = 19𝑦
⇒ 𝑧 = 2𝑡 + 1 ⇒ (2𝑡 + 1)2 + (2𝑡 + 1) ⋅ 2𝑡 + 4𝑡 = 19𝑦
⇒ 3 ⋅ 4𝑡 + 3 ⋅ 2𝑡 + 1 = 19𝑦 .
For 𝑡 = 1 we have 3 ⋅ 4 + 3 ⋅ 2 + 1 = 19𝑦 ⇒ 19𝑦 = 19 ⇒ 𝑦 = 1 ⇒ 𝑧 =
21 + 1 = 3 ⇒ 𝑥 = 3𝑡 = 3 thus one solution of the equation is
(𝑥, 𝑦, 𝑧) = (3,1,3).
For 𝑡 = 3 we have 19𝑦 = 3 ⋅ 43 + 3 ⋅ 23 + 1 = 217 = 7 ⋅ 31 which is not
possible.
For 𝑡 ≥ 5, we have
3 ⋅ 4𝑡 + 3 ⋅ 2𝑡 + 1 ≡ 1(𝑚𝑜𝑑 8).
Since 191 ≡ 19(𝑚𝑜𝑑 8) ≡ 3(𝑚𝑜𝑑 8) ∧ 192 ≡ 32 (𝑚𝑜𝑑 8) ≡ 1(𝑚𝑜𝑑 8).
Therefore 𝑜𝑟𝑑8 (19) = 2. From the equation we have that 𝑦 is an even
number, thus there exists a positive integer 𝑢 such that 𝑦 = 2𝑢 so the
equation transforms as
3 ⋅ 2𝑡 (2𝑡 + 1) = 192𝑢 − 1 = (19𝑢 − 1)(19𝑢 + 1).
Since 19𝑢 + 1 − (19𝑢 − 1) = 2 thus 𝑔𝑐𝑑(19𝑢 − 1,19𝑢 + 1) = 2. Since
19𝑢 − 1 and 19𝑢 + 1 are even and since 19𝑢 + 1 ≡ 2,4(𝑚𝑜𝑑 8) also

22
(19𝑢 − 1)(19𝑢 + 1) is divisible by 2𝑡 and since 2𝑡−1 is divisible by 8 we
have that 19𝑢 − 1 is divisible with 2𝑡−1 , also
19𝑢 − 1 ≡ 1 − 1(𝑚𝑜𝑑 9) ≡ 0(𝑚𝑜𝑑 9) so 19𝑢 − 1 is also divisible by 9 so
there exists a positive integer 𝑣 such that
19𝑢 − 1 = 9 ⋅ 2𝑡−1 ⋅ 𝑣 > 3 ⋅ 2 ⋅ 2𝑡−1 = 3 ⋅ 2𝑡 .
Therefore from the equation we have
3 ⋅ 2𝑡 (2𝑡 + 1) = (19𝑢 − 1)(19𝑢 + 1) > 3 ⋅ 2𝑡 (3 ⋅ 2𝑡 + 2) > 3 ⋅ 2𝑡 (2𝑡 + 1)
which is a contradiction.
Therefore the only solution of the given equation is (𝑥, 𝑦, 𝑧) = (3,1,3).

23
 4. IMO Test Selection Team - Solutions
Problem T1. Ben has a winning strategy.. At first we note that Ben does
not need to touch a card more than once. If he touches a card more than
once, then the combination will be the same as if he would’ve touched
that card twice less. Therefore, if there is a strategy for more than 2019
touches, there will exist a strategy also for 2019 or less touches.
Therefore, from now on, we will ignore the number of touches that Ben
makes.
Let ⊡ denote the situation when in a card a number is visible and ⊠
when in a paper a letter is visible.
Lemma 1. If the cards are in the following order ⊡ ��
⊠⊠
����
… ⊠⊠
���, there is
2018
a strategy for Ben to win the game.
Proof. Let 𝑎𝑖 denote the card in the position 𝑖, counted from left to right,
in the initial position. If Ben touches cards according to this order:
𝑎2 , 𝑎3 , 𝑎5 , 𝑎6 , 𝑎8 , 𝑎9 , … , 𝑎2015 , 𝑎2016 , 𝑎2018 , 𝑎2019 , then all the papers in
their initial positions will be turned to the letters side.
Let us illustrate it with an example with nine cards. In a similar way the
case for 2019 cards is performed. The initial position is as follows:
⊡⊠⊠⊠⊠⊠⊠⊠⊠. The cards Ben should touch are in the following
order: 𝑎2 , 𝑎3 , 𝑎5 , 𝑎6 , 𝑎8 , 𝑎9 .
⊠⊡⊡⊠⊠⊠⊠⊠⊠ ⊠⊠⊠⊡⊠⊠⊠⊠⊠ ⊠⊠⊠⊠⊡⊡⊠⊠⊠
⊠⊠⊠⊠⊠⊠⊡⊠⊠ ⊠⊠⊠⊠⊠⊠⊠⊡⊡ ⊠⊠⊠⊠⊠⊠⊠⊠⊠
Let the cards be in any order. Let us show that all other cases turn in the
case when all cards are turned in the numbers side or in the case when
the first leftmost paper is the only card from the number side.
According to the conditions of the problem, it is clear that at least one
card is turned on the number side. Beginning from right to left, Ben
identifies the first card in which a number appears. Then, he touches the
first card to the left of the previously identified card. Ben repeats this
process until it is no longer possible to repeat it. The process becomes
impossible to continue in the following two cases: all the cards are
turned in the letters side or when the first card from the left is the only
24
card turned in the number side. Therefore, at the end of the process the
ordering of cards will be: ��
⊠⊠ … ⊠⊠
���� ��� or ⊡ ⊠⊠ ������
… ⊠⊠
���. In the first
2019 2018
case, all cards are on the letter side. Thus Ben wins the game. While in
the second case, from the previous Lemma, Ben wins the game.

Problem T2. Let 𝑃(𝑥, 𝑦) denote the initial relation. We have 𝑃(0,0),
from which we get:
𝑓(0) + 4𝑓(0)2 = 𝑓(0) ⇒ 4𝑓(0)2 = 0 ⇒ 𝑓(0) = 0.
We have 𝑃�0, 4√𝑥 � for 𝑥 ≥ 0, which implies:
𝑓(−𝑥) + 4𝑓(0)2 = 𝑓(𝑥) ⇒ 𝑓(−𝑥) = 𝑓(𝑥) ∀𝑥 ≥ 0 ⇒ 𝑓(−𝑥) = 𝑓(𝑥), ∀𝑥 ∈ ℝ.
So the function is even. Therefore it is sufficient to find all values of
function 𝑓(𝑥) only for 𝑥 ≥ 0. We get 𝑃�√𝑥, √𝑥� for 𝑥 ≥ 0, which gives:
𝑓(0) + 4𝑓(𝑥)2 = 𝑓(2𝑥 2 ) ⇒ 𝑓(2𝑥 2 ) = 4𝑓(𝑥)2 ≥ 0, ∀𝑥 ≥ 0.
Thus, the last relation can be written as:
�𝑓(2𝑥 2 )
𝑓(𝑥) = , ∀𝑥 ≥ 0.
2
Since the function is even gives:
�𝑓(2𝑥 2 )
𝑓(𝑥) = 2
, ∀𝑥 ∈ ℝ (1)

Using (1) the initial relation transforms as:

𝑓(𝑥 4 − 𝑦 4 ) + 𝑓(2𝑥 2 𝑦 2 ) = 𝑓(𝑥 4 + 𝑦 4 ). (2)
Next we show (using the quadratic equation) that for any two non-
negative real numbers 𝑎, 𝑏 exist real numbers 𝑥, 𝑦 such that
𝑎 𝑏
𝑥 4 − 𝑦 4 = � and 2𝑥 2 𝑦 2 = � . Such a pair, satisfying the condition is:
2 2

4 √𝑎 + 𝑏 + √𝑎 4 √𝑎 + 𝑏 − √𝑎
𝑥=� ∧𝑦 = � .
√8 √8
𝑎+𝑏
Since 𝑥 4 + 𝑦 4 = �(𝑥 4 − 𝑦 4 )2 + (2𝑥 2 𝑦 2 )2 = � , from (2) we obtain:
2

25
 𝑎 𝑏 𝑎+𝑏
𝑓 �� � + 𝑓 �� � = 𝑓 �� �, for any two non-negative real numbers
2 2 2
𝑎, 𝑏.
Using (1) the last relation becomes:
�𝑓(𝑎) + �𝑓(𝑏) = �𝑓(𝑎 + 𝑏)
for all 𝑎, 𝑏 ∈ ℝ+
0.

Let 𝑔(𝑥) = �𝑓(𝑥) for 𝑥 ∈ ℝ+ + +

0 , then the function 𝑔: ℝ0 → ℝ0 satisfies

𝑔(𝑥) + 𝑔(𝑦) = 𝑔(𝑥 + 𝑦) ∀𝑥, 𝑦 ∈ ℝ+

0.

Thus, 𝑔 is a Cauchy function. Since 𝑔 is bounded from below, then

𝑔(𝑥) = 𝑐𝑥 for all 𝑥 ∈ ℝ+ +
0 and some constant 𝑐 ∈ ℝ0 .

After substitutions we have 𝑓(𝑥) = 𝑐 2 𝑥 2 for all 𝑥 ∈ ℝ+

0 . Since the
function is even we have 𝑓(𝑥) = 𝑐 2 𝑥 2 for all 𝑥 ∈ ℝ and some
√4𝑐 2 𝑥 4
constant 𝑐 ∈ ℝ+ 2 2
0 . We substitute in (1), which gives 𝑐 𝑥 = 2
= 𝑐𝑥 2 .
Since it should hold for all 𝑥 ∈ ℝ, gives:
𝑐 2 = 𝑐 ⇒ 𝑐 = 0 ∨ 𝑐 = 1 ⇒ 𝑓(𝑥) = 0, ∀𝑥 ∈ ℝ ∨ 𝑓(𝑥) = 𝑥 2 , ∀𝑥 ∈ ℝ.
We see that both functions satisfy the condition, therefore these are the
only solutions.

Problem T3. Let 𝑓(𝑛) = 𝑛2 + 𝑛 + 1. We have to show that 𝑓(𝑛)|𝑓(2𝑛 ).

Since 𝑓(𝑛2 ) = 𝑛4 + 𝑛2 + 1 = (𝑛2 − 𝑛 + 1)(𝑛2 + 𝑛 + 1) = (𝑛2 − 𝑛 +
1)𝑓(𝑛), then 𝑓(𝑛)|𝑓(𝑛2 ).
Using the last relation we find that:
𝑘
𝑓(𝑛) | 𝑓(𝑛2 ) | 𝑓(𝑛4 ) |… |𝑓 �𝑛2 �.
𝑘
Thus, 𝑓(𝑛)|𝑓 �𝑛2 �, for all 𝑛, 𝑘 ∈ ℕ.

Since we have to show that there are infinitely many positive integers 𝑛
such that 𝑓(𝑛)|𝑓(2𝑛 ), it is sufficient to show that there are infinitely
many positive integers 𝑛 such that there exists a positive integer 𝑘 such
𝑘 𝑘
that 𝑛2 = 2𝑛 since in that case we would have 𝑓(𝑛)|𝑓 �𝑛2 � = 𝑓(2𝑛 ). If

26
 𝑚 𝑘 2𝑚
we take 𝑛 = 22 and 𝑘 = 2𝑚 − 𝑚, we have 𝑛2 = 22 = 2𝑛 . This
completes the proof since there are infinitely many positive integers of
𝑚
the form 𝑛 = 22 .

Problem T4. Let 𝐴𝐵 = 𝑎 and 𝐵𝐶 = 2𝑏. Then,

1 𝑏3 1 𝑏
𝑆(𝐶𝐸𝐹) = � + 𝑎𝑏� = ⋅ (𝑎2 + 𝑏 2 ).
2 𝑎 2 𝑎
Since 𝐸 is midpoint of 𝐷𝐴, then 𝐸𝐷 = 𝑏. From the Pythagorean theorem
we have:
𝐸𝐶 2 = 𝐸𝐷 2 + 𝐶𝐷 2 = 𝑏 2 + 𝑎2 ⇒ 𝐸𝐶 = √𝑎2 + 𝑏 2 .
Let 𝐿 be the point of intersection of height from 𝐹 in 𝐸𝐶 and 𝑀 the
intersection point of the lines 𝐵𝐶 and 𝐸𝐹. Then,
1 𝑏 2 1 1
⋅ (𝑎 + 𝑏 2 ) = 𝑆(𝐶𝐸𝐹) = ⋅ 𝐸𝐶 ⋅ 𝐹𝐿 = ⋅ �𝑎2 + 𝑏 2 ⋅ 𝐹𝐿 ⇒ 𝐹𝐿
2 𝑎 2 2
𝑏
= √𝑎2 + 𝑏 2.
𝑎

Since ∠𝐶𝑀𝐸 = ∠𝐹𝐿𝐸 = 90∘ ∧ ∠𝐶𝐸𝑀 = ∠𝐹𝐸𝐿, then triangles 𝐶𝑀𝐸 and
𝐹𝐿𝐸 are similar. Therefore:
𝐸𝐿 𝐸𝑀 𝐸𝐿 𝑎
= ⇒𝑏 = ⇒ 𝐸𝐿 =
𝐹𝐿 𝐶𝑀 √𝑎 2 +𝑏2 𝑏
𝑎
√𝑎2 + 𝑏 2 = 𝐸𝐶 ⇒ 𝐿 ≡ 𝐶.
Let 𝜔 denote the circumcircle
of the triangle 𝐸𝐵𝐶. Since 𝐵 is
the symmetric point of 𝐶 with
respect to the line 𝐸𝐹, we
have:
∠𝐸𝐵𝐹 = ∠𝐸𝐶𝐹 = ∠𝐸𝐻𝐹 = 90∘ .
So, points 𝐹 and 𝐻 belong to
the circle 𝜔 whose diameter is
the segment 𝐸𝐹.
From the similarity of triangles 𝐴𝐸𝐶 and 𝐴𝐺𝐸 we have:
180∘ − ∠𝐶𝐺𝐸 = ∠𝐴𝐺𝐸 = ∠𝐴𝐸𝐶 = 90∘ + ∠𝐹𝐸𝐶 = 90∘ + ∠𝐹𝐻𝐶 = ∠𝐸𝐻𝐶,
27
thus the quadrilateral 𝐸𝐻𝐶𝐺 is cyclic and consequently the point 𝐺
belongs to the circle 𝜔.
Since 𝐸𝐵 = 𝐸𝐶, then ∠𝐸𝐺𝐶 = ∠𝐸𝐻𝐵, as angles above the chords of equal
length. Therefore,
∠𝑋𝐺𝑌 = 180∘ − ∠𝐸𝐺𝐶 = 180 − ∠𝐸𝐻𝐵 = ∠𝑋𝐻𝑌,
Consecutively quadrilateral 𝑋𝑌𝐺𝐻 is cyclic.
Since
∠𝐻𝑋𝑌 = 180∘ − ∠𝐻𝐺𝑌 = ∠𝐻𝐺𝐶 = ∠𝐻𝐵𝐶,
Then we have that 𝑋𝑌 ∥ 𝐵𝐶. Since 𝐴𝐵𝐶𝐷 is rectangle then 𝐴𝐵 ⊥ 𝐵𝐶,
therefore 𝑋𝑌 ⊥ 𝐴𝐵.

Problem T5. We show that

𝑎 + 𝑏𝑥 𝑏 + 𝑐𝑥 𝑐 + 𝑑𝑥 𝑑 + 𝑎𝑥 𝑎 𝑏 𝑐 𝑑
+ + + ≤ + + + .
𝑏 + 𝑐𝑥 𝑐 + 𝑑𝑥 𝑑 + 𝑎𝑥 𝑎 + 𝑏𝑥 𝑏 𝑐 𝑑 𝑎
𝑎 𝑏 𝑐 𝑑
We use substitutions = 𝑢, = 𝑣, = 𝑤, = 𝑡.
𝑏 𝑐 𝑑 𝑎

Thus 𝑢, 𝑣, 𝑤, 𝑡 are positive real numbers. The inequality is equivalent to

𝑢+𝑥 𝑣+𝑥 𝑤+𝑥 𝑡+𝑥
� �𝑣 + � �𝑤 + � �𝑡 + � � 𝑢 ≤ 𝑢 + 𝑣 + 𝑤 + 𝑡.
𝑣+𝑥 𝑤+𝑥 𝑡+𝑥 𝑢+𝑥
We set 𝑢 + 𝑥 = 𝑚, 𝑣 + 𝑥 = 𝑛, 𝑤 + 𝑥 = 𝑝, 𝑡 + 𝑥 = 𝑞, then 𝑚, 𝑛, 𝑝, 𝑞 > 𝑥.
The last inequality is equivalent to
𝑚(𝑛 − 𝑥) 𝑛(𝑝 − 𝑥) 𝑝(𝑞 − 𝑥) 𝑞(𝑚 − 𝑥)
+ + + ≤ 𝑚 + 𝑛 + 𝑝 + 𝑞 − 4𝑥
𝑛 𝑝 𝑞 𝑚
which is equivalent to
𝑚𝑛𝑝𝑞(𝑚 + 𝑛 + 𝑝 + 𝑞) − 𝑥(𝑚2 𝑝𝑞 + 𝑛2 𝑞𝑚 + 𝑝2 𝑚𝑛 + 𝑞 2 𝑛𝑝)
≤ 𝑚𝑛𝑝𝑞(𝑚 + 𝑛 + 𝑝 + 𝑞) − 4𝑥𝑚𝑛𝑝𝑞.
One further can show that the last inequality is equivalent to
𝑥(𝑚2 𝑝𝑞 + 𝑛2 𝑞𝑚 + 𝑝2 𝑚𝑛 + 𝑞 2 𝑛𝑝) ≥ 4𝑥𝑚𝑛𝑝𝑞.
Using Arithmetic-Geometric mean we have

28
 4
𝑚2 𝑝𝑞 + 𝑛2 𝑞𝑝 + 𝑝2 𝑚𝑛 + 𝑞 2 𝑛𝑝 ≥ 4�(𝑚2 𝑝𝑞)(𝑛2 𝑞𝑝)(𝑝2 𝑚𝑛)(𝑞2 𝑛𝑝)
= 4𝑚𝑛𝑝𝑞.
Since 𝑥 ≥ 0, multiplying with 𝑥 both sides of last inequality gives
𝑥(𝑚2 𝑝𝑞 + 𝑛2 𝑞𝑚 + 𝑝2 𝑚𝑛 + 𝑞 2 𝑛𝑝) ≥ 4𝑥𝑚𝑛𝑝𝑞.
𝑎 𝑏 𝑐 𝑑
Since 𝑓(0) = + + + we have
𝑏 𝑐 𝑑 𝑎
𝑎 𝑏 𝑐 𝑑
max 𝑓(𝑥) = 𝑓(0) = + + + .
𝑥≥0 𝑏 𝑐 𝑑 𝑎

29
Notes
Notes
Notes