HRV ABooklet 2018

MATHEMATICAL
COMPETITIONS
IN CROATIA
Zagreb, 2018
Croatian Mathematical Society

Mathematical competitions in Croatia in 2018
In Croatia, children undergo twelve years of formal education – from 1st to 8th grade
in primary school and from 9th to 12th grade in secondary school. Mathematical com-
petitions are held for students from 4th to 12th grade. Competitions at the secondary
school level have two categories – category A (for students who attend mathematical
grammar schools) and category B (for all other secondary school students).
In the year 2018, around 17000 students participated in the first round of the compet-
itions, more than 13000 of them from primary schools. The City competitions were
held on 25th January. All tests at this level consist of five easier problems and two
harder problems, as well as tests for category B at County competitions. All other
tests at County competitions and all the tests at National competition consist of five
problems.
On County competitions held on 28th February, 1996 primary school students and
1116 secondary school students (531 of them in category A) participated. The best
89 students from primary school (from 5th to 8th grade), and 168 secondary school
students (92 in category A and 76 in category B) were invited to the National com-
petition in Poreč (from 12th to 14th April).
After the National competition, the top 25 students from category A were invited to
the Croatian Mathematical Olympiad, a three-round team selection phase. The first
two tests took place on 5th and 6th May, and separate final selection tests for the IMO
and MEMO teams on 13th May. All tests consisted of four olympiad-style problems
from four different areas: algebra, combinatorics, geometry and number theory.
After the Croatian Mathematical Olympiad, the teams for the 59th International
Mathematical Olympiad (IMO) in Romania and the 12th Middle European Mathem-
atical Olympiad (MEMO) in Poland were selected:
IMO MEMO
1
Petar Nizić–Nikolac (grade 12) Luka Bulić Bračulj 6 (grade 10)
Ivan Novak 2 (grade 12) Krunoslav Ivanović 1 (grade 11)
Borna Šimić 3 (grade 12) Noel Lakić 5 (grade 10)
Tadej Petar Tukara 1 (grade 12) Krešimir Nežmah 1 (grade 9)
Ilja Uzelac Bujišić 4 (grade 11) Andrija Tomorad 1 (grade 11)
Marin Varivoda 5 (grade 11) Ivan Vojvodić 1 (grade 9)
1
XV. gimnazija, Zagreb, 2 Srednja škola Vrbovec, Vrbovec, 3 Gimnazija “Matija Mesić”,
Slavonski Brod, 4 Matematička gimnazija, Belgrade (Serbia), 5 Gimnazija Franje Pet-
rića, Zadar, 6 III. gimnazija, Split.
i
ii
Along with those, the top 12 primary school students (grades 7 and 8, exclusively) were
invited to the Croatian Junior Mathematical Olympiad, held on 15th May. After the
competition, the team for the 22nd Junior Balkan Mathematical Olympiad (JBMO)
in Greece was selected:
JBMO
Bartol Bućan 7 (grade 8)
Bernard Inkret 8 (grade 8)
Dorijan Lendvaj 9 (grade 8)
Patrik Pavić 10 (grade 8)
Matej Vojvodić 11 (grade 8)
7
Osnovna škola “Bol”, Split, 8 Osnovna škola Rude, Samobor, 9 Osnovna škola Pop-
ovača, Popovača, 10 Osnovna škola Ante Kovačića, Zagreb, 11 Osnovna škola Vladimir
Deščak, Sveta Nedelja.
Contents
Mathematical competitions in Croatia in 2018 i
1 First round – City competition 1
2 Second round – County competition 5
3 Final round – National competition 8

3.1 Solutions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11
4 Croatian Mathematical Olympiad 23

4.1 Solutions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 26
5 Croatian Junior Mathematical Olympiad 37

5.1 Solutions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37
In this booklet we present the problems from mathematical competitions for

category A in Croatia in 2018. The solutions are given for the problems of the Final
round, the Croatian Mathematical Olympiad and the Croatian Junior Mathematical
Olympiad.
Problems are numerated according to secondary school classes, e.g. 2.4. is the 4th
problem for the 2nd class of secondary school (10th grade).
We have tried to acknowledge the authors or the sources of the problems wherever it
was possible.
iii
1 First round – City competition
1.1. In 2018 Matija will turn the age which is equal to three times the sum of digits of
the year he was born in. The same statement is true for his grandfather. What
age did his grandfather turn in the year Matija was born? (Tamara Srnec)
1.2. Let 𝐴𝐵𝐶 be a right-angled triangle with the right angle at 𝐶, having sides of
length |𝐴𝐵| = 26 and |𝐵𝐶| = 24. A semicircle with diameter on 𝐵𝐶 containing
point 𝐶 is inscribed in the triangle. The semicircle touches the side 𝐴𝐵. What
is the radius of the semicircle? (Nikola Adžaga)
1.3. A positive integer 𝑁 is called interesting if it is divisible by 36, and if there exists
a positive integer 𝑘 smaller than 10 such that 1, 2, . . . , 𝑘 are, in some order, the
digits of the decimal representation of 𝑁 . Find the smallest interesting positive
integer. (Lucija Validžić)
1.4. Determine all pairs (𝑥, 𝑦) of real numbers such that 𝑥 + 𝑦 = 𝑥2 + 𝑦 2 = 𝑥3 + 𝑦 3 .

(Tamara Srnec)
1.5. In how many ways can we fill a 2018 × 2018 board with positive integers so that
the sum of numbers in any three consecutive cells in the same row or the same
column equals 5? (Matija Bašić)
1.6. Let 𝐴𝐵𝐶 be a triangle such that |𝐴𝐵| = 6 and |𝐵𝐶| = 9, and let the measure
of the angle ^𝐴𝐵𝐶 be 120∘ . Let 𝑃 and 𝑄 be points on the side 𝐴𝐶 such that
the triangle 𝐵𝑃 𝑄 is equilateral. Determine the length of the segment 𝑃 𝑄.
1.7. Marin labels the vertices of a cube with numbers 1, 2, . . . , 8, and then labels
each edge with the sum of numbers in the vertices joined by that edge. Can
he arrange the numbers in the vertices so that all the edges are labelled with
different numbers?
***
2.1. Find all complex numbers 𝑧 such that

Re (𝑧) = 9 and Im (𝑧 2 ) = Im (𝑧 3 ). (AIME 2007)
2.2. Let 𝐴𝐵𝐶𝐷 be a rectangle. A certain number of red lines are drawn between the
lines 𝐴𝐵 and 𝐶𝐷, parallel to them, and a certain number of blue lines are drawn
between the lines 𝐴𝐷 and 𝐵𝐶, parallel to them. This divides the rectangle into
775 smaller rectangles, while the red and the blue lines intersect at 720 points.
How many red, and how many blue lines are there? (Matko Ljulj)
1
2.3. Determine all triples (𝑝, 𝑞, 𝑟) of prime numbers such that
𝑝𝑞 = 𝑟 − 1.
2.4. Determine all pairs (𝑥, 𝑦) of real numbers such that
𝑥2 + 𝑥𝑦 − 4𝑦 2 = −1
4𝑥2 + 𝑥𝑦 − 11𝑦 2 = −2. (Nikola Adžaga)
2.5. Let 𝐴𝐵𝐶𝐷 be a trapezium with bases 𝐴𝐵 and 𝐶𝐷, such that 𝐴𝐵𝐶 is an
acute-angled triangle. Let 𝑂 be the centre of the circle circumscribed to the
triangle 𝐴𝐵𝐶, and let 𝐸 be the intersection of lines 𝑂𝐵 and 𝐶𝐷. If ^𝐷𝐵𝐶 =
^𝐶𝐸𝐵 + 10∘ , find the measure of the angle between the diagonals of 𝐴𝐵𝐶𝐷.
(Anastazija Pažanin)
2.6. Let 𝐴𝐵𝐶 be a right-angled triangle with the right angle at 𝐶, such that |𝐴𝐶| = 2
and |𝐵𝐶| = 1. A square is situated inside the triangle so that two of its vertices
are on the side 𝐴𝐶, the third one is on the side 𝐴𝐵, and the fourth is on
the circle of radius 1 centred at 𝐵. Determine the length of the side of the
square. (The Netherlands 2017)
2.7. The rows of a 50 × 50 table are labelled with numbers 𝑎1 , . . . , 𝑎50 , while the
colums are labelled with numbers 𝑏1 , . . . , 𝑏50 . These 100 numbers are mutually
distinct, and exactly 50 of them are rational. The table is filled so that the
number 𝑎𝑖 + 𝑏𝑗 is written in the (𝑖, 𝑗) cell, for 𝑖, 𝑗 = 1, 2, . . . , 50. Determine the
largest possible number of rational numbers written in the table cells.
(Russia 2017)
***
3.1. Determine all real numbers 𝑥 such that

1 + sin 𝑥
16 6 3.
1 − sin 𝑥
3.2. Four cubes with edges of length 1, 2, 3

and 4 are placed next to each other as X
pictured. Determine the length of the
part of the segment 𝑋𝑌 that is situated Y
1
inside the cube of length 3. 2
3
4
3.3. Determine all real numbers 𝑥 such that
(𝑥 − 1009)3 + (2𝑥 − 1009)3 + (2018 − 3𝑥)3 = 0. (Ratko Višak)

First round – City competition 3
3.4. In how many ways can the letters 𝐴 𝐵 𝐶 𝐷 𝐸 𝐹 𝐺 𝐻 𝐼 be arranged so that all
of the vowels and all of the consonants are ordered alphabetically?
3.5. Find all prime numbers 𝑝 for which there exists a positive integer 𝑚 such that
the number
𝑝𝑚 + 4
is a square of some positive integer. (Nikola Adžaga)
3.6. Let 𝐵𝐷 and 𝐶𝐸 be the altitudes of the acute-angled triangle 𝐴𝐵𝐶. Determine
the smallest possible measure of angle ^𝐵𝐴𝐶 such that |𝐴𝐸|·|𝐴𝐷| = |𝐵𝐸|·|𝐶𝐷|
can possibly hold.
3.7. A building consists of the ground floor and 100 additional floors. The lift in the
building has only two buttons, 𝐴 and 𝐵. By pressing 𝐴 the lift rises 7 floors,
and by pressing 𝐵 the lift goes down 9 floors. Is it possible to reach every floor
from any other floor using this lift?
***
4.1. Find the last two digits of the number (1!)2 + (2!)2 + · · · + (2018!)2 .
(Lucija Validžić)
[︁ 𝜋 ]︁
4.2. Let 𝑧 be a complex number such that arg 𝑧 ∈ , 𝜋 and 𝑧 6 + 𝑧 3 + 1 = 0.
2
Determine the modulus and the argument of 𝑧.
The argument of the complex number 𝑧 = |𝑧|(cos 𝜙 + 𝑖 sin 𝜙) is the number
arg 𝑧 = 𝜙.
𝑛+2
4.3. Prove that 22 +4 is a multiple of 10 for any positive integer 𝑛. (Tamara Srnec)
4.4. A box holds 𝑛 balls, some of which are white, and some are black. Find 𝑛 if
the probability that by drawing two balls we draw exactly one white and one
black is 21 , and we know that there are 2018 more balls of one colour than the
other. (Lucija Validžić)
4.5. Find the locus of the centres of all circles that are externally tangent to the
circle that satisfies 𝑥2 + 𝑦 2 − 4𝑦 + 3 = 0, and that are also tangent to the
𝑥-axis. (Anastazija Pažanin)
4.6. Let 𝑎1 , 𝑎2 , . . . , 𝑎41 be an arithmetic sequence such that

1 1 1
√ √ +√ √ + ··· + √ √
𝑎1 + 𝑎2 𝑎2 + 𝑎3 𝑎40 + 𝑎41
is a positive integer. If 𝑎1 = 1, and the common difference of the sequence is a
positive integer, find the common difference. (Anastazija Pažanin)
4.7. There are 27 common 1 × 1 × 1 playing dice marked with

numbers 1 to 6, like in the picture above (1 is opposite
to 6, 2 is opposite to 5, and 3 is opposite to 4).
A 3 × 3 × 3 cube is assembled so that the dice are always
touching with sides marked with the same number. We
observe sums of the numbers written on the sides of the
larger cube. These sums are marked with 𝐴, 𝐵, 𝐶, 𝐷,
𝐸 and 𝐹 , like in the picture below (opposing pairs are 𝐴
and 𝐵, 𝐶 and 𝐷, 𝐸 and 𝐹 ).
If 𝐴 = 9 and 𝐶 = 36, find 𝐵, 𝐷, 𝐸 and 𝐹 . (Matija Bašić)
2 Second round – County competition
1.1. Marko has drawn a rectangle with two blue sides of length 24 and two red sides
of length 36. He coloured each point in the interior of the rectangle in the colour
of the side closest to that point. He also coloured in black all points equally
distant from a blue and red side. Determine the area of the red part of the
rectangle. (Italy 2009)
1.2. Determine all pairs (𝑚, 𝑛) of integers such that
𝑛2 − 6𝑛 = 𝑚2 + 𝑚 − 10.
1.3. Let 𝑎, 𝑏 and 𝑐 be different positive real numbers such that (𝑎 + 𝑏 − 𝑐)(𝑏 + 𝑐 −
𝑎)(𝑐 + 𝑎 − 𝑏) ̸= 0. Prove that at least one of the numbers
𝑎+𝑏 𝑏+𝑐 𝑐+𝑎

, ,
𝑎+𝑏−𝑐 𝑏+𝑐−𝑎 𝑐+𝑎−𝑏
lies in the interval ⟨1, 2⟩, and that at least one of these numbers does not lie in
that interval.
1.4. Let 𝐷 be the foot of the altitude from 𝐶 in the isosceles triangle 𝐴𝐵𝐶 with
the base 𝐴𝐵. Point 𝑀 is the midpoint of the segment 𝐶𝐷. Lines 𝐵𝑀 and 𝐴𝐶
intersect at the point 𝐸. Determine the ratio |𝐶𝐸| : |𝐴𝐶|.
1.5. There are 599 yellow and 301 blue balls. Can these balls be ordered in a sequence
so that the number of balls between any two blue balls is different from 2
and 5? (Mathematics Stack Exchange)
***
2.1. Let 𝑧 be a complex number such that
|𝑧 − 5| = |𝑧 − 1| + 4.
Prove that 𝑧 is a real number.
2.2. Let 𝐴𝐵𝐶𝐷 be a square with side length 1. Let 𝑋 be a point on the side 𝐴𝐵,
and let 𝑌 be a point on the side 𝐴𝐷 such that ^𝐶𝑋𝑌 = 90∘ . Find the locus
of the point 𝑋 for which the area of the triangle 𝐶𝐷𝑌 is the smallest possible.
5
6 Second round – County competition
2.3. Determine all positive integers 𝑛 for which the quadratic equation
𝑥2 − 3𝑛𝑥 + 𝑛 + 3 = 0
has integer solutions.
2.4. There are two non-intersecting circles, of radii 𝑟1 and 𝑟2 . The distance between
the points of tangency of the inner common tangent to these circles is 12, while
the distance between the points of tangency of the outer common tangent to
these circles is 16. Determine the product 𝑟1 𝑟2 .
Inner tangent (is that common tangent that) intersects the segment between the
centres of the circles.
2.5. Let 𝑛 > 4 be a positive integer. Prove that among any 𝑛 numbers from the set
{1, 2, . . . , 2𝑛 − 1}
there are some of them with the sum divisible by 2𝑛. (Ratko Višak)
***
[︁ 𝜋 ]︁
3.1. Determine all pairs (𝑥, 𝑦) of real numbers such that 𝑥, 𝑦 ∈ 0, for which the
2
following holds:
2 sin2 𝑥 + 2
= 3 + cos (𝑥 + 𝑦). (Petar Bakić)
sin 𝑥 + 1
3.2. Let 𝑎, 𝑏 and 𝑐 be positive real numbers such that

√ √
𝑎2 + 𝑏2 − 𝑐2 = 3𝑎𝑏, 𝑎2 − 𝑏2 + 𝑐2 = 2𝑎𝑐.
Determine the ratio 𝑏 : 𝑐. (Hong Kong 2002)
3.3. Determine all positive integers which are squares of integers, and which have
exactly two non-zero digits in the decimal representation, one of which is equal
to 3.
3.4. In a quadrilateral 𝐴𝐵𝐶𝐷 it holds that ^𝐷𝐵𝐶 = ^𝐷𝐶𝐵 = 50∘ and ^𝐷𝐴𝐵 =
^𝐴𝐵𝐶 = ^𝐵𝐷𝐶. Prove that 𝐴𝐶 ⊥ 𝐵𝐷. (Ratko Višak)
3.5. Let 𝑛 be a positive integer. A sequence of 2𝑛 real numbers is good if for each
positive integer 1 6 𝑚 6 2𝑛 the sum of first 𝑚 or the sum of last 𝑚 terms of
the sequence is an integer. Determine the least possible number of integers in a
good sequence. (The Netherlands 2017)
***
Second round – County competition 7
4.1. A positive integer is called Babylonic if it is greater than 9, and if its base-
60 representation is the same as its decimal representation without the first
digit. For example, the number 123 is Babylonic since 123 = (23)60 . How many
Babylonic numbers less than 10 000 are there? (Mea Bombardelli)
4.2. Let 𝑛 be a positive integer. Prove that

1 1 1
+ + ··· + > 1.
𝑛+1 𝑛+2 3𝑛 + 1
4.3. Let 𝐴𝐵𝐶 be an acute-angled triangle such that |𝐵𝐶| > |𝐴𝐶|. The perpendicular
bisector of the segment 𝐴𝐵 intersects the side 𝐵𝐶 at point 𝑃 , and the line 𝐴𝐶
at point 𝑄. Let 𝑅 be the foot of the perpendicular from point 𝑃 to the side
𝐴𝐶, and let 𝑆 be the foot of the perpendicular from point 𝑄 to the line 𝐵𝐶.
Prove that the line 𝑅𝑆 bisects the segment 𝐴𝐵.
4.4. Let 𝑃 be a board obtained by deleting three corner squares of the board 7 × 7.
A positive integer is written in each of the 46 squares of the board 𝑃 . The
difference between numbers in any two squares sharing a side is at most 4.
Prove that there are two squares with the same number.
(Mathematics Stack Exchange)
4.5. Let 𝑑 be a positive integer, and let (𝑎𝑛 ) be an arithmetic sequence of positive
integers with the common difference 𝑑. If 𝑑 6 2018, prove that at most 11
consecutive terms of that sequence can be prime numbers.
3 Final round – National competition
1.1. Determine all triples (𝑥, 𝑦, 𝑧) of real numbers that satisfy
𝑥 + 𝑦 − 𝑧 = −1
𝑥2 − 𝑦 2 + 𝑧 2 = 1
−𝑥3 + 𝑦 3 + 𝑧 3 = −1.
(Olimpíada Iberoamericana de Matemática 1989)
1.2. Let 𝐷0 , 𝐷1 , . . . , 𝐷2018 be points on the segment 𝐴𝐵 such that 𝐷0 = 𝐴, 𝐷2018 =

𝐵 and
|𝐷0 𝐷1 | = |𝐷1 𝐷2 | = · · · = |𝐷2017 𝐷2018 |.
If 𝐶 is a point such that ^𝐵𝐶𝐴 = 90∘ , prove that
|𝐶𝐷0 |2 + |𝐶𝐷1 |2 + · · · + |𝐶𝐷2018 |2 = |𝐴𝐷1 |2 + |𝐴𝐷2 |2 + · · · + |𝐴𝐷2018 |2 .
(Ivan Krijan)
1.3. Let 𝑝 be a prime number and let 𝑛 > 𝑝 − 1 be an integer. If 𝑛𝑝 + 1 is a perfect

square, prove that 𝑛 + 1 can be represented as a sum of squares of exactly 𝑝
positive integers. (Mathematics Stack Exchange)
1.4. Let 𝐴𝐵𝐶 be a triangle such that ^𝐶𝐴𝐵 = 2^𝐴𝐵𝐶. A point 𝐷 is given in the
interior of the triangle 𝐴𝐵𝐶, such that |𝐴𝐷| = |𝐵𝐷| and |𝐶𝐷| = |𝐴𝐶|. Prove
that ^𝐴𝐶𝐵 = 3^𝐷𝐶𝐵. (Ratko Višak)
1.5. We say that a circular arrangement of positive integers is alternating if every

number is either smaller, or larger than both of its neighbours. We call a pair
of adjacent numbers good if, upon its removal, the remaining numbers form an
alternating arrangement.
The numbers 1 to 300 are placed on a circle in an alternating arrangement.
Determine the least possible number of good pairs of adjacent numbers in such
arrangement.
***
2.1. Determine all positive integers 𝑛 such that there exist positive integers 𝑎 and 𝑏
which satisfy
𝑆(𝑎) = 𝑆(𝑏) = 𝑆(𝑎 + 𝑏) = 𝑛.
Here 𝑆(𝑎) denotes the sum of digits of 𝑎. (Romania 1999)
8
Final round – National competition 9
2.2. Branko is writing a sequence of quadratic polynomials with real coefficients. In

each step, he considers the polynomial he chose in the previous step, denoted by
𝑎𝑥2 +𝑏𝑥+𝑐, and proceeds to write down either 𝑐𝑥2 +𝑏𝑥+𝑎 or 𝑎(𝑥+𝑑)2 +𝑏(𝑥+𝑑)+𝑐
for some real number 𝑑.
Starting from 𝑥2 − 2𝑥 − 1 and performing a finite number of prescribed steps,
can Branko obtain the following polynomial:
a) 2𝑥2 − 1?
b) 2𝑥2 − 𝑥 − 1? (Stipe Vidak)
2.3. A trapezium 𝐴𝐵𝐶𝐷 is given. The bisector of the leg 𝐵𝐶 intersects the leg 𝐴𝐷
at 𝑀 , while the bisector of 𝐴𝐷 intersects 𝐵𝐶 at 𝑁 .
Let 𝑂1 and 𝑂2 be the circumcentres of triangles 𝐴𝐵𝑁 and 𝐶𝐷𝑀 , respectively.
Prove that the line 𝑂1 𝑂2 bisects the segment 𝑀 𝑁 . (Stipe Vidak)
2.4. Determine all pairs (𝑝, 𝑞) of prime numbers for which 𝑝𝑞−1 + 𝑞 𝑝−1 is a perfect
square. (Simon Marais Mathematics Competition 2017)
2.5. An 𝑛 × 𝑛 square board is given, where 𝑛 is an odd positive integer. Each of

the 2𝑛(𝑛 + 1) unit segments delimiting the unit squares is coloured either red
or blue. It is known that there are no more than 𝑛2 red unit segments.
Prove that there is a unit square on the board whose border comprises at least
three blue segments. (Mathematics Stack Exchange)
***
3.1. Prove the identity

𝑥 𝑥 + 2𝜋 𝑥 + 4𝜋 3
cos3 + cos3 + cos3 = cos 𝑥
3 3 3 4
for every real number 𝑥. (Željko Hanjš)
3.2. Let 𝑆 = {0, 95}. In each step, Lucija is extending the set 𝑆 in the following way.
She chooses a polynomial with coefficients in 𝑆, distinct from zero, and extends
𝑆 with all integer roots of a chosen polynomial. She repeats the procedure by
choosing another polynomial with coefficients from the extended set 𝑆 as long
as she can get new roots.
Prove that Lucija can, in a finite number of steps, extend the set 𝑆 up to the
set which is no longer extensible. How many elements does the set 𝑆 have at
the end?
3.3. Determine all pairs (𝑎, 𝑏) of positive integers such that 𝑎2 𝑏 divides 𝑏2 + 3𝑎.
(Nikola Adžaga)
3.4. In an isosceles triangle 𝐴𝐵𝐶 with |𝐴𝐵| = |𝐴𝐶|, points 𝑀 and 𝑁 are the
midpoints of the sides 𝐴𝐵 and 𝐵𝐶, respectively. The circle circumscribed to
the triangle 𝐴𝑀 𝐶 meets the line 𝐴𝑁 at point 𝑃 different from 𝐴. The line
passing through 𝑃 parallel to the side 𝐵𝐶 meets the circle circumscribed to the
triangle 𝐴𝐵𝐶 at points 𝐵1 and 𝐶1 . Prove that the triangle 𝐴𝐵1 𝐶1 is equilateral.
3.5. Two players alternately write one digit at a time, from left to right. A player
loses if, after his move, there is a sequence of digits
𝑎1 , 𝑎2 , . . . , 𝑎𝑛
such that there exists a positive integer 𝑘 for which the number 𝑎𝑘 𝑎𝑘+1 . . . 𝑎𝑛 is
a multiple of 11.
Which player can win regardless of how his opponent plays? (Russia 2003)
***
4.1. Let 𝑛 be a positive integer. Prove that for all 𝑥1 , 𝑥2 , . . . , 𝑥𝑛 ∈ [0, 1] the following
holds:
(𝑥1 + 𝑥2 + · · · + 𝑥𝑛 + 1)2 > 4(𝑥21 + 𝑥22 + · · · + 𝑥2𝑛 ). (ASU 1979)
4.2. A Gaussian integer is a complex number whose real and imaginary parts are
both integers. Determine the largest positive integer 𝑛 for which there is a
set of 𝑛 Gaussian integers such that the squares of their absolute values are
consecutive positive integers. (Matko Ljulj)
4.3. Let 𝑓 : N → N be a function such that

𝑓 (𝑎𝑏) = 𝑓 (𝑎 + 𝑏)
for all positive integers 𝑎 > 4 and 𝑏 > 4.
Prove that 𝑓 (𝑛) = 𝑓 (8) for all positive integers 𝑛 > 8.
(Mathematics Stack Exchange)
4.4. Let 𝐵𝐷 and 𝐶𝐸 be the altitudes of an acute-angled triangle 𝐴𝐵𝐶. The circle
with diameter 𝐴𝐶 meets 𝐵𝐷 at 𝐹 . The circle with diameter 𝐴𝐵 meets the line
𝐶𝐸 at points 𝐺 and 𝐻, where 𝐺 is between 𝐶 and 𝐸. If ^𝐶𝐻𝐹 = 12∘ , find
the measure of the angle ^𝐴𝐺𝐹 . (Go Geometry)
4.5. There are 300 contestants at the competition. Each pair of the contestants is
either acquainted (knows each other) or unfamiliar with each other, and there
are no three contestants who all know each other. Determine the maximum
possible 𝑛 such that the following conditions hold:
∙ Every contestant is acquainted with at most 𝑛 other contestants.
∙ For every positive integer 𝑚 such that 1 6 𝑚 6 𝑛, there is at least one
contestant who is acquainted with exactly 𝑚 other contestants.
(Mongolia 2017)
3.1 Solutions
1.1. From the first equation we get 𝑥 + 𝑦 = 𝑧 − 1. By plugging this into the second
equation we get:
𝑥2 − 𝑦 2 = 1 − 𝑧 2 ,
(𝑥 + 𝑦)(𝑥 − 𝑦) = (1 − 𝑧)(1 + 𝑧),
(𝑧 − 1)(𝑥 − 𝑦) = −(𝑧 − 1)(1 + 𝑧),
(𝑧 − 1)(𝑥 − 𝑦 + 𝑧 + 1) = 0.
There are now two cases: 𝑧 = 1 or 𝑥 − 𝑦 + 𝑧 + 1 = 0.

If 𝑧 = 1, then 𝑥 + 𝑦 = 0, i.e. 𝑥 = −𝑦. Plugging this into the third equation we get
2𝑦 3 = −2, i.e. 𝑦 = −1, 𝑥 = 1.
If 𝑥 − 𝑦 + 𝑧 + 1 = 0, then plugging 𝑧 = −𝑥 + 𝑦 − 1 into the first equation yields
2𝑥 = −2, i.e. 𝑥 = −1.
Now we have 𝑧 = −(−1) + 𝑦 − 1 = 𝑦, which we can combine with the third equation
to get 2𝑦 3 = −2, i.e. 𝑦 = 𝑧 = −1.
Thus, the possible solutions to the given system of equations are (1, −1, 1) and
(−1, −1, −1). A direct computation confirms that both are indeed valid solutions
of the system.
1.2. Let 𝐸𝑖 be the foot of the altitude from 𝐷𝑖 to the side 𝐴𝐶 in the right-angled
triangle 𝐴𝐵𝐶, for each 𝑖 = 0, 1, . . . 2018. We have 𝐸0 = 𝐴, 𝐸2018 = 𝐶.
B = D2018
·
··
Di
·
··
C = E2018 ··· ··· A = D0 = E0

Ei
Since the lines 𝐷𝑖 𝐸𝑖 are parallel to 𝐵𝐶, Thales’ theorem asserts that
|𝐸0 𝐸1 | = |𝐸1 𝐸2 | = · · · = |𝐸2017 𝐸2018 |.
From here we get |𝐶𝐸𝑖 | = |𝐴𝐸2018−𝑖 | for 𝑖 = 1, 2, . . . , 2017.

The Pythagorean theorem, applied to the right-angled triangles 𝐶𝐷𝑖 𝐸𝑖 and 𝐴𝐷𝑖 𝐸𝑖
for 𝑖 = 1, 2, . . . , 2017, yields
|𝐶𝐷𝑖 |2 = |𝐷𝑖 𝐸𝑖 |2 + |𝐶𝐸𝑖 |2 and |𝐴𝐷𝑖 |2 = |𝐷𝑖 𝐸𝑖 |2 + |𝐴𝐸𝑖 |2 .
By subtracting these two equalities, we get
|𝐶𝐷𝑖 |2 − |𝐴𝐷𝑖 |2 = |𝐶𝐸𝑖 |2 − |𝐴𝐸𝑖 |2 , 𝑖 = 1, . . . , 2017,
and the same relation also holds for 𝑖 = 0 and 𝑖 = 2018.

Adding up all these relations, we get
|𝐶𝐷0 |2 + |𝐶𝐷1 |2 + · · · + |𝐶𝐷2018 |2 − |𝐴𝐷0 |2 − |𝐴𝐷1 |2 − · · · − |𝐴𝐷2018 |2

= |𝐶𝐸0 |2 + |𝐶𝐸1 |2 + · · · + |𝐶𝐸2018 |2 − |𝐴𝐸0 |2 − |𝐴𝐸1 |2 − · · · − |𝐴𝐸2018 |2
= (|𝐶𝐸0 |2 − |𝐴𝐸2018 |2 ) + (|𝐶𝐸1 |2 − |𝐴𝐸2017 |2 ) + · · · + (|𝐶𝐸2018 |2 − |𝐴𝐸0 |2 ) = 0.
Since |𝐴𝐷0 | = 0, this proves the claim.
1.3. Let 𝑎 be a positive integer such that 𝑛𝑝 + 1 = 𝑎2 . Note that 𝑎 > 1.

We have 𝑎2 − 1 = 𝑛𝑝, i.e. (𝑎 − 1)(𝑎 + 1) = 𝑛𝑝.
Since 𝑝 is prime, it follows that 𝑝 | 𝑎 − 1 or 𝑝 | 𝑎 + 1. We treat these two cases
separately:
i) Let 𝑝 | 𝑎 − 1, i.e. let 𝑎 = 𝑘𝑝 + 1 for some integer 𝑘.

Then 1 + 𝑛𝑝 = (𝑘𝑝 + 1)2 = 𝑘 2 𝑝2 + 2𝑘𝑝 + 1, i.e. 𝑛 = 𝑘 2 𝑝 + 2𝑘.
Now we have:
𝑛 + 1 = 𝑘 2 𝑝 + 2𝑘 + 1 = 𝑘 2 + 2𝑘 + 1 + (𝑝 − 1)𝑘 2 = (𝑘 + 1)2 + (𝑝 − 1) · 𝑘 2 .
Notice that 𝑎 > 1 implies 𝑘 > 0, so 𝑘 + 1 and 𝑘 are both positive integers.
ii) Let 𝑝 | 𝑎 + 1, so that 𝑎 = 𝑘𝑝 − 1 for some integer 𝑘.
Analogously to the first case, we get 𝑛 + 1 = (𝑘 − 1)2 + (𝑝 − 1) · 𝑘 2 .
It remains to show that 𝑘 − 1 is indeed a positive integer, i.e. that we have 𝑘 > 2.
If we assume the contrary (𝑘 = 1), it follows that 𝑛 + 1 = 𝑝 − 1, i.e. 𝑛 = 𝑝 − 2.
This contradicts the given condition that 𝑛 > 𝑝 − 1.
We conclude that the assertion holds for any choice of 𝑛 and 𝑝 satisfying the conditions
of the problem.
1.4. Let 𝐸 be the intersection of the bisector of the segment 𝐴𝐵 with the segment
𝐵𝐶.
Denote 𝛽 = ^𝐴𝐵𝐶 and notice that ^𝐴𝐶𝐵 = 180∘ − 3𝛽.
Since 𝐸 lies on the bisector of the segment 𝐴𝐵, we have |𝐴𝐸| = |𝐵𝐸|. Therefore,
^𝐵𝐴𝐸 = ^𝐴𝐵𝐶 = 𝛽. This implies ^𝐸𝐴𝐶 = ^𝐶𝐴𝐵 − 𝛽 = 2𝛽 − 𝛽 = 𝛽.
Let 𝐹 be the other intersection of the line 𝐴𝐸 with the circle of radius 𝐶𝐴 centred at
𝐶. Since 𝐶𝐴𝐹 is an isosceles triangle (𝐶𝐴 and 𝐶𝐹 are both radii of the same circle),
we get ^𝐶𝐹 𝐴 = 𝛽.
C F
D
A B
From ^𝐶𝐹 𝐴 = ^𝐵𝐴𝐹 we get 𝐶𝐹 ‖ 𝐴𝐵 (these are the angles of the transversal).
This also means that ^𝐵𝐶𝐹 = ^𝐶𝐵𝐴 = 𝛽, which shows that 𝐶𝐸𝐹 is an isosceles
triangle.
From 𝐶𝐹 ‖ 𝐴𝐵 and the fact that 𝐸 is equidistant to 𝐶 and 𝐹 , we conclude that the
line 𝐷𝐸 is the bisector of the segment 𝐶𝐹 as well.
Thus, |𝐷𝐹 | = |𝐷𝐶| = |𝐶𝐹 |, i.e. the triangle 𝐷𝐹 𝐶 is equilateral.
1 1
Finally, we have ^𝐷𝐶𝐵 = 60∘ −𝛽 = (180∘ −3𝛽) = ^𝐴𝐶𝐵, i.e. ^𝐴𝐶𝐵 = 3^𝐷𝐶𝐵.
3 3
1.5. Let 𝑎, 𝑝, 𝑞 and 𝑏 be four consecutive numbers in an alternating arrangement.

Assume 𝑝 > 𝑞. Then 𝑎 < 𝑝 and 𝑞 < 𝑏.
The pair (𝑝, 𝑞) is not good if and only if 𝑎 > 𝑏. Therefore, we conclude that (𝑝, 𝑞) is
not good if and only if 𝑝 is the largest, and 𝑞 the smallest number of the quadruple
(𝑎, 𝑝, 𝑞, 𝑏).
If (𝑝, 𝑞) is not good, then (𝑎, 𝑝) is, because 𝑎 is greater than or equal to 𝑞. Furthermore,
(𝑞, 𝑏) is good because 𝑏 is not greater than 𝑝.
This shows that, of any two pairs sharing an element, at least one is a good pair. We
conclude that there are at least 150 good pairs.
Assume that there is an alternating arrangement 𝑎1 , . . . , 𝑎300 in which there are ex-
actly 150 good pairs.
Without loss of generality, we can assume that 𝑎1 > 𝑎2 , and that (𝑎1 , 𝑎2 ) is not a
good pair. Then (𝑎2𝑘 , 𝑎2𝑘+1 ) are both good, while the pair (𝑎2𝑘−1 , 𝑎2𝑘 ) is not, for any
𝑘 = 1, 2, . . . , 149. We also notice that (𝑎299 , 𝑎300 ) cannot be a good pair.
Since (𝑎1 , 𝑎2 ) is not good, we conclude that 𝑎1 > 𝑎3 . Similarly, since (𝑎3 , 𝑎4 ) is not
good, we get 𝑎3 > 𝑎5 . Continuing this way, we get
𝑎1 > 𝑎3 > 𝑎5 > · · · > 𝑎299 > 𝑎1 ,
thus arriving at a contradiction. This shows that it is impossible to have exactly 150
good pairs. Therefore, there must be at least 151 of them.
An example of an alternating arrangement containing exactly 151 good pairs is
3, 2, 5, 4, 7, 6, . . . , 299, 298, 300, 1.
In this arrangement, all of the pairs (2𝑘, 2𝑘 + 3) for 𝑘 = 1, . . . , 148 are not good, as
well as the pair (300, 1), while the rest of the pairs are good.
***
2.1. Notice that, for each positive integer 𝑎, the numbers 𝑎 and 𝑆(𝑎) give the same
remainder when divided by 9.
Applying this observation to 𝑆(𝑎) = 𝑆(𝑏) = 𝑆(𝑎 + 𝑏), we conclude that 𝑎, 𝑏 and 𝑎 + 𝑏
give the same remainder when divided by 9. This implies that (𝑎 + 𝑏) − 𝑏 = 𝑎 and
(𝑎 + 𝑏) − 𝑎 = 𝑏 are both divisible by 9. But then 𝑎 and 𝑏 are also divisible by 9. This
proves that any positive integer 𝑛 satisfying the given condition must be divisible
by 9.
Let us now prove the converse: let 𝑛 be a multiple of 9, i.e. let 𝑛 = 9𝑘 for some
positive integer 𝑘. Taking numbers
𝑎 = 18 . . . 18, 𝑏 = 72 . . . 72, 𝑎 + 𝑏 = 90 . . . 90,
where each of the numbers has exactly 2𝑘 digits, we obtain a pair (𝑎, 𝑏) which satisfies
𝑆(𝑎) = 𝑆(𝑏) = 𝑆(𝑎 + 𝑏) = 9𝑘 = 𝑛.
2.2. a) The first polynomial, i.e. 2𝑥2 −1, can be obtained by applying the following
sequence of steps:
𝑑=−1
𝑥2 − 2𝑥 − 1 →
− −𝑥2 − 2𝑥 + 1 −−−−→ −𝑥2 + 2 →
− 2𝑥2 − 1.
b) Notice that the prescribed steps leave the discriminant unchanged: the discrim-
inant of 𝑐𝑥2 + 𝑏𝑥 + 𝑎 is 𝑏2 − 4𝑐𝑎 = 𝑏2 − 4𝑎𝑐, whereas the discriminant of
𝑎(𝑥 + 𝑑)2 + 𝑏(𝑥 + 𝑑) + 𝑐 = 𝑎𝑥2 + (2𝑎𝑑 + 𝑏)𝑥 + (𝑎𝑑2 + 𝑏𝑑 + 𝑐)
equals
(2𝑎𝑑 + 𝑏)2 − 4𝑎(𝑎𝑑2 + 𝑏𝑑 + 𝑐) = 4𝑎2 𝑑2 + 4𝑎𝑏𝑑 + 𝑏2 − 4𝑎2 𝑑2 − 4𝑎𝑏𝑑 − 4𝑎𝑐 = 𝑏2 − 4𝑎𝑐.
The discriminant of the initial polynomial 𝑥2 −2𝑥−1 is 8, while the discriminant

of 2𝑥2 − 𝑥 − 1 equals 9. Thus, Branko cannot obtain the polynomial 2𝑥2 − 𝑥 − 1
in any number of allowed steps.
Remark: Consider the prescribed steps as operations T1 and T2 on triples of real
numbers:
T1 T2
(𝑎, 𝑏, 𝑐) −−→ (𝑐, 𝑏, 𝑎) and (𝑎, 𝑏, 𝑐) −−→ (𝑎, 2𝑎𝑑 + 𝑏, 𝑎𝑑2 + 𝑏𝑑 + 𝑐).
Given any two quadratic polynomials 𝑓 (𝑥) and 𝑔(𝑥) with equal discriminants, we can
obtain a sequence of steps transforming 𝑓 (𝑥) into 𝑔(𝑥): first, we apply T2 to adjust
the constant term of 𝑓 (𝑥), making it equal to the leading coefficient of 𝑔(𝑥). After
that, we can use T1 to swap the leading coefficient with the constant term. Finally,
using T2, we can adjust the new constant term making it equal to the constant term
of 𝑔(𝑥).
This last step guarantees that the resulting polynomial will have the same constant
term as 𝑔(𝑥). The leading coefficient is also equal to the one appearing in 𝑔(𝑥),
because it remains unchanged by T2. Finally, the linear term also matches the one
appearing in 𝑔(𝑥): it is uniquely determined (up to sign) by the discriminant and the
remaining two coefficients. If necessary, we can change its sign by applying T2 with
𝑑 = −𝑏/𝑎.
2.3. Denote by 𝑃 and 𝑄 the midpoints of 𝐵𝐶 and 𝐴𝐷, respectively.
D C
Q O2 P
N
M
A B
O1
We will show that the quadrilateral 𝐴𝐵𝑁 𝑀 is cyclic.

From ^𝑀 𝑄𝑁 = ^𝑁 𝑃 𝑀 = 90∘ , we get that the quadrilateral 𝑀 𝑁 𝑃 𝑄 is cyclic. This
implies ^𝑃 𝑄𝑀 + ^𝑀 𝑁 𝑃 = 180∘ .
The segment 𝑄𝑃 is the midsegment of the trapezium 𝐴𝐵𝐶𝐷, which means that it is
parallel to 𝐴𝐵. From here we conclude that ^𝑀 𝐴𝐵 = ^𝐷𝑄𝑃 . Now we have
^𝑀 𝐴𝐵 = ^𝐷𝑄𝑃 = 180∘ − ^𝑃 𝑄𝑀 = ^𝑀 𝑁 𝑃 = 180∘ − ^𝐵𝑁 𝑀,
which is enough to conclude that the quadrilateral 𝐴𝐵𝑁 𝑀 is cyclic.

Analogously, we show that the quadrilateral 𝑀 𝑁 𝐶𝐷 is cyclic.
This shows that the segment 𝑀 𝑁 is simultaneously a chord for both circumscribed
circles of triangles 𝐴𝐵𝑁 and 𝐶𝐷𝑀 . We conclude that the line 𝑂1 𝑂2 , connecting the
centres of these circles, must bisect the segment 𝑀 𝑁 .
2.4. Let 𝑛 be a positive integer such that
𝑝𝑞−1 + 𝑞 𝑝−1 = 𝑛2 .
We will divide our solution into cases, depending on the parity of numbers 𝑝 and 𝑞. If
both are even, the only possibility is that both are equal to 2. This leads to a solution
(𝑝, 𝑞) = (2, 2) for 𝑛 = 2.
If both 𝑝 and 𝑞 are odd, we conclude that there are no solutions by looking at the
remainder of division by 4. If 𝑝 and 𝑞 are odd, then 𝑝 − 1 and 𝑞 − 1 are even, so
that 𝑝𝑞−1 and 𝑞 𝑝−1 are squares of odd numbers. This means that they always give
remainder 1 when divided by 4. This shows that the left-hand side gives remainder 2
when divided by 4, whereas 𝑛2 must give remainder 1 or 0 when divided by 4.
The only remaining case is when one of the numbers 𝑝 and 𝑞 is even, while the other
is odd. The equation being symmetric, we can, without loss of generality, assume
that 𝑝 is odd, i.e. 𝑝 = 2𝑘 + 1 for some positive integer 𝑘, and that 𝑞 equals 2.
Now we have
𝑝 + 2𝑝−1 = 𝑛2 , i.e. 𝑝 = 𝑛2 − 22𝑘 = (𝑛 − 2𝑘 )(𝑛 + 2𝑘 ).
Since 𝑝 is prime, the only way in which we can represent it as a product (𝑛−2𝑘 )(𝑛+2𝑘 )
is if one of the factors equals ±1, while the other is ±𝑝. Notice that 𝑛 + 2𝑘 > 0, and
also that 𝑛 + 2𝑘 > 𝑛 − 2𝑘 , which yields
𝑛 − 2𝑘 = 1 and 𝑛 + 2𝑘 = 𝑝.
Subtracting these two equalities, we get
2𝑘+1 + 1 = 𝑝 = 2𝑘 + 1.
Let us prove that this equation has no solution. We know that 2𝑘+1 +1 gives remainder
1 when divided by 4, so the same must hold for 2𝑘 + 1. This implies that 𝑘 is even,
i.e. 𝑘 = 2𝑙 for some positive integer 𝑙. In that case,
𝑝 = 2𝑘+1 + 1 = 22𝑙+1 + 1 = 2 · 4𝑙 + 1
is divisible by 3 (because 4𝑙 gives remainder 1 when divided by 3). We conclude that

𝑝 is divisible by 3, so 𝑝 = 3. Plugging this into the initial equation, we see that 𝑝 = 3
and 𝑞 = 2 is not a solution.
This means that the only solution is (𝑝, 𝑞) = (2, 2).
2.5. Assume the contrary, i.e. that there is no square bordered by three or four blue
segments. Then each square is bordered by at least two red segments.
Now we count the pairs (𝑃, 𝑟), where 𝑃 is a unit square, and 𝑟 is a red segment
adjacent to 𝑃 . We will count them in two different ways.
Since every square is bordered by at least two red segments, we have at least 2𝑛2
such pairs. On the other hand, each segment on the edge of the board has only one
adjacent square, while the interior segments have two adjacent squares. This shows
that we can express the number of pairs (𝑃, 𝑟) as 𝑉 + 2𝑈 , where 𝑉 is the number of
red segments on the edge of the board, and 𝑈 the number of interior red segments.
Thus 2𝑛2 6 2𝑈 + 𝑉 .
Furthermore, since there are no more than 𝑛2 red segments, we also have 𝑈 + 𝑉 6 𝑛2 .
Adding these two inequalities we get 𝑉 = 0 and 𝑈 = 𝑛2 .
This shows that the inequalities we derived are in fact equalities, so that each square
is bordered by exactly two red segments and all the red segments are interior (not on
the edge of the board).
Now we checker the board, black–white. Notice that each white square contains
exactly two red segments, and that each red segment belongs to a uniquely determined
white square. This means that there are 2𝐵 red segments, where 𝐵 is the number of
white squares. However, this leads to a contradiction because we know that there are
exactly 𝑛2 red segments, and 𝑛2 is odd.
This shows that our assumption was wrong, so there must be some unit square with
at least three blue adjacent segments.
***
3.1. Using the identity

𝑡 𝑡
cos 𝑡 = 4 cos3− 3 cos
3 3
for 𝑡 = 𝑥, 𝑡 = 𝑥 + 2𝜋 and 𝑡 = 𝑥 + 4𝜋, summing the relations and using the periodicity
of cosine, we obtain
(︂ )︂
𝑥 𝑥 + 2𝜋 𝑥 + 4𝜋
3 cos 𝑥 = 4 cos3 + cos3 + cos3
3 3 3
(︂ )︂
𝑥 𝑥 + 2𝜋 𝑥 + 4𝜋
−3 cos + cos + cos .
3 3 3
Transforming the expression in the second parenthesis yields

𝑥 𝑥 + 4𝜋 𝑥 + 2𝜋 2𝜋 𝑥 + 2𝜋 𝑥 + 2𝜋
cos + cos + cos = 2 cos cos + cos
3 3 3 (︂ 3 )︂3 3
2𝜋 𝑥 + 2𝜋
= 2 cos + 1 cos = 0.
3 3
Finally, we conclude
𝑥 𝑥 + 2𝜋 𝑥 + 4𝜋 3
cos3 + cos3 + cos3 = cos 𝑥.
3 3 3 4
3.2. If the coefficients of a polynomial are integers, then its roots must divide the
constant term. Without loss of generality, we may assume that the constant term of
the chosen polynomial is non-zero, so we conclude that we can extend 𝑆 only with
the divisors of 95. Since 95 has only finitely many divisors, Lucija will not be able to
extend 𝑆 indefinitely.
We will prove that Lucija can add all the divisors of 95 into 𝑆, i.e. that 𝑆 will have 9
elements in the end.
Since −1 is the root of the polynomial 95𝑥 + 95, we can add −1 to 𝑆.
Number 1 is a root of −𝑥95 − 𝑥94 − · · · − 𝑥 + 95, so 𝑆 can be extended with 1.
Now we can extend 𝑆 with −95 because it is the root of 𝑥 + 95.

Polynomial −𝑥3 + 𝑥2 + 𝑥 + 95 with coefficients in 𝑆 has a root 5, hence 5 becomes an
element of 𝑆. Now we add −5 into 𝑆, because −5 is the root of 𝑥 + 5.
In the end, −19, 19 ∈ 𝑆 since these are the roots of polynomials 5𝑥 + 95 and 5𝑥 − 95.
3.3. The given condition implies that
𝑎2 𝑏𝑘 = 𝑏2 + 3𝑎
for some positive integer 𝑘. The equation 𝑎2 𝑏𝑘 − 3𝑎 = 𝑏2 implies 𝑎 | 𝑏2 and 𝑏 | 3𝑎.

Therefore, the numbers
𝑏2 3𝑎 𝑏2 + 3𝑎 𝑏 3
, and = 2+
𝑎 𝑏 𝑎2 𝑏 𝑎 𝑎𝑏
9𝑎
are integers. By multiplying the second and the third one, we conclude that 𝑏2 is an
integer, meaning that 𝑏2 | 9𝑎. Now we have
𝑏2 𝑚 = 9𝑎, 𝑎𝑛 = 𝑏2
for some positive integers 𝑚 and 𝑛. This implies 𝑚𝑛 = 9. Hence, 𝑛 ∈ {1, 3, 9}, which
means that 𝑏2 ∈ {𝑎, 3𝑎, 9𝑎}. The initial condition now implies 𝑎𝑏 | 𝑛 + 3.
We have three possible values for 𝑛.
If 𝑛 = 1, then 𝑏2 = 𝑎, so the initial condition becomes 𝑏5 | 4𝑏2 , i.e. 𝑏3 divides 4. We
obtain one solution 𝑎 = 𝑏 = 1.
𝑏5
If 𝑛 = 3, then 𝑏2 = 3𝑎, so 9 | 2𝑏2 , i.e. 𝑏3 | 18. Since 𝑏 is a multiple of 3, there is no
solution in this case.
𝑏5
If 𝑛 = 9, then 𝑏2 = 9𝑎, so 81 | 43 𝑏2 , i.e. 𝑏3 | 108. Since 𝑏 is a multiple of 3, we obtain
a solution (𝑎, 𝑏) = (1, 3).
The only solutions are (1, 1) and (1, 3).
3.4. The points 𝐴, 𝑀 , 𝑃 and 𝐶 lie on the same circle and ^𝑀 𝐴𝑃 = ^𝑃 𝐴𝐶. There-
fore, |𝑀 𝑃 | = |𝑃 𝐶| because the corresponding subtended angles are equal. Since 𝑃
lies on the bisector of 𝐵𝐶, we conclude that |𝐵𝑃 | = |𝐶𝑃 |. Hence |𝑀 𝑃 | = |𝐵𝑃 |,
which means that the point 𝑃 lies on the bisector of the segment 𝐵𝑀 .
Let 𝑄 be the midpoint of the segment 𝐵𝑀 , and 𝑂 be the centre of the circumcircle
of the triangle 𝐴𝐵𝐶.
Notice that 𝑃 𝑄 ⊥ 𝐴𝐵 and 𝑂𝑀 ⊥ 𝐴𝐵, which implies that 𝑃 𝑄 ‖ 𝑂𝑀 . Since 𝑀 is
the midpoint of 𝐴𝐵, and 𝑄 is the midpoint of 𝑀 𝐵, it follows that |𝑀 𝑄| = 13 |𝐴𝑄|.
For the same reason we have |𝑂𝑃 | = 31 |𝐴𝑃 |.
M
Q
B N C
O
B1 P C1
Consider a triangle 𝐴𝐵1 𝐶1 . Its circumcentre is point 𝑂, while 𝑃 is the foot of its
altitude from vertex 𝐴. Since 𝐴, 𝑂 and 𝑃 are collinear, the triangle is isosceles.
Therefore, the segment 𝐴𝑃 is also a median of the triangle, so |𝑂𝑃 | = 13 |𝐴𝑃 | implies
that 𝑂 is the centroid. Finally, since the centroid coincides with the circumcentre,
the triangle 𝐴𝐵1 𝐶1 is isosceles.
3.5. We will show that the second player can win regardless of the first player actions.
Obviously, none of the players will write 0 in any step.
Notice that 10𝑟 ≡ (−1)𝑟 (mod 11), so the following criterion for divisibility with 11
holds:
𝑎𝑘 𝑎𝑘+1 . . . 𝑎𝑛 ≡ 𝑎𝑛 − 𝑎𝑛−1 + 𝑎𝑛−2 − · · · + (−1)𝑛−𝑘 𝑎𝑘 (mod 11).
Denote by 𝑁𝑘 the remainder when dividing 𝑎𝑘 𝑎𝑘+1 . . . 𝑎𝑛 by 11, for 𝑘 = 1, . . . , 𝑛. If,

after the 𝑛th move, the numbers
𝑁1 , . . . , 𝑁𝑛
are pairwise distinct, then by the mentioned criterion, in the next move we obtain
the numbers
𝑎𝑛+1 − 𝑁1 , . . . , 𝑎𝑛+1 − 𝑁𝑛 , 𝑎𝑛+1 (mod 11),
which are also pairwise distinct since 𝑎𝑛+1 ̸= 0. Inductively, we conclude that after
each step of the game (for 𝑛 6 10), the numbers 𝑁1 , . . . , 𝑁𝑛 are distinct. Because of
the way in which 𝑁1 , . . . , 𝑁𝑛 transform at each move, we conclude that there are at
most 𝑛 + 1 digits which, if the player writes them, will cause him to lose.
Assume that the game lasts for at least nine moves. The second player loses if and
only if, after the ninth move, the set {𝑁1 , 𝑁2 , . . . , 𝑁9 } is {1, 2, . . . , 9}, i.e. the second
player wins if and only if 10 is among the numbers 𝑁1 , 𝑁2 , . . . , 𝑁9 .
If, after the eighth move, {𝑁1 , . . . , 𝑁8 } lacks two numbers between 1 and 10 which
are not consecutive, then, no matter what the first player chooses in ninth move, one
of the numbers 𝑁1 , . . . , 𝑁9 must be 10. Namely, if the first player chooses 𝑋, then
there is 𝑘 such that 𝑁𝑘 = 𝑋 + 1 (in eighth move). Hence, after the ninth move we
obtain
𝑁𝑘 ≡ 𝑋 − (𝑋 + 1) ≡ −1 ≡ 10 (mod 11).
Let us show that the second player can ensure that after the eighth move, among
the numbers 𝑁1 , . . . , 𝑁8 there are no two consecutive numbers. Certainly, the second
player can ensure that the game lasts at least seven moves. Let
{𝑁1 , . . . , 𝑁7 } = {1, 2, . . . , 10} ∖ {𝑋, 𝑌, 𝑍}.
If among the numbers 𝑋, 𝑌 and 𝑍 there are no consecutive ones, then the second
player can choose any of them. If 𝑌 = 𝑋 + 1, then the second player can write one
of the numbers 𝑋 or 𝑋 + 1 so that, after the eighth move, there are two consecutive
numbers missing from 𝑁1 , . . . , 𝑁8 . Namely, if 𝑍 = 𝑋 − 1, the second player writes
𝑋, and if 𝑍 ̸= 𝑋 − 1, the second player writes 𝑋 + 1.
***
4.1. Since 𝑥𝑖 ∈ [0, 1], we conclude that 𝑥𝑖 > 𝑥2𝑖 , i.e.
4(𝑥1 + 𝑥2 + · · · + 𝑥𝑛 ) > 4(𝑥21 + 𝑥22 + · · · + 𝑥2𝑛 ).
Denote 𝑆 = 𝑥1 + 𝑥2 + · · · + 𝑥𝑛 . Notice that, because of the previous bound, it suffices

to show that
(𝑆 + 1)2 > 4𝑆.
This inequality obviously holds since it is equivalent to (𝑆 − 1)2 > 0.
4.2. If a complex number 𝑧 = 𝑥 + 𝑦𝑖 is Gaussian integer, then |𝑧|2 = 𝑥2 + 𝑦 2 is the

sum of two squares of integers.
The square of an even integer is divisible by 4, while the square of an odd integer
gives remainder 1 when divided by 4. Therefore, the sum of squares of two integers
can give remainder 0, 1 or 2 when divided by 4.
If 𝑛 is greater than 3, then among any four consecutive positive integers in the se-
quence
|𝑧1 |2 , |𝑧2 |2 , . . . , |𝑧𝑛 |2
there would be a number giving the remainder 3 when divided by 4, which is im-
possible. Hence, 𝑛 is less than or equal to 3.
Notice that 2 + 2𝑖, 3 and 3 + 𝑖 are Gaussian integers whose absolute values squared
are 8, 9 and 10, respectively. Therefore, the answer for 𝑛 is 3.
4.3. Let 𝑛 > 8 be a positive integer. The problem condition implies that
𝑓 (𝑛) = 𝑓 (4 + (𝑛 − 4)) = 𝑓 (4(𝑛 − 4)) = 𝑓 (2(𝑛 − 4) + 2(𝑛 − 4))

= 𝑓 (4(𝑛 − 4)(𝑛 − 4)) = 𝑓 (4(𝑛 − 4) + (𝑛 − 4))
= 𝑓 (5(𝑛 − 4)) = 𝑓 (5 + 𝑛 − 4)
= 𝑓 (𝑛 + 1).
Therefore, by the principle of mathematical induction, we conclude that 𝑓 (𝑛) = 𝑓 (8)

for all 𝑛 > 8.
4.4. The chord 𝐺𝐻 is perpendicular to 𝐴𝐵, so 𝐴𝐵 is the bisector of the segment

𝐺𝐻. Hence |𝐴𝐺| = |𝐴𝐻|.
Since 𝐴𝐹 𝐶 is a right-angled triangle, Euclid’s theorem gives us |𝐴𝐹 |2 = |𝐴𝐷| · |𝐴𝐶|.
Analogously, since 𝐴𝐵𝐺 is a right-angled triangle, we have |𝐴𝐺|2 = |𝐴𝐸| · |𝐴𝐵|.
E
D
F G
B C
Angles ^𝐵𝐷𝐶 and ^𝐵𝐸𝐶 are right angles, so the quadrilateral 𝐵𝐶𝐷𝐸 is cyclic. By
using the power-of-a-point theorem applied to 𝐴 with respect to the circle circum-
scribed to the quadrilateral 𝐵𝐶𝐷𝐸, we conclude that |𝐴𝐷| · |𝐴𝐶| = |𝐴𝐸| · |𝐴𝐵|.
Hence |𝐴𝐹 | = |𝐴𝐺| = |𝐴𝐻|, i.e. the point 𝐴 is the circumcentre of the triangle 𝐺𝐹 𝐻.
Finally,
1 1 1
^𝐴𝐺𝐹 = ^𝐺𝐹 𝐴 = (180∘ − ^𝐹 𝐴𝐺) = (180∘ − 2^𝐹 𝐻𝐺) = (180∘ − 24∘ ) = 78∘ .
2 2 2
4.5. The maximum possible 𝑛 is 200.

Let us assume that there is a contestant, say 𝑋, who knows 201 other contestants and
let those 201 contestants make up a set 𝑆. There must exist contestants who know
exactly 1, 2, . . . , 200 other contestants.
We will say that the contestant has degree 𝑚 if he knows exactly 𝑚 other contestants.
Each element in 𝑆 has degree at most 99. Namely, he cannot know anyone from 𝑆
since there are no three contestants who all know each other (aside from 𝑋 and 𝑆,
there are only 98 contestants).
We conclude that contestants from 𝑆 have at most 99 distinct degrees. Simultaneously,
there are 98 contestants not in 𝑆 and different from 𝑋, so they can have at most 98
distinct degrees.
This shows that there are at most 1 + 99 + 98 = 198 < 201 distinct degrees, and there-
fore it is impossible that there are contestants who know exactly 1, 2, . . . , 201 other
contestants. Hence, there is no contestant who knows exactly 201 other contestants.
Let us now show that 𝑛 = 200 is possible. Denote 100 contestants as 𝐴1 , 𝐴2 , . . . , 𝐴100
and call them 𝐴-contestants, and the remaining 200 as 𝐵1 , 𝐵2 , . . . , 𝐵200 and call them
𝐵-contestants.
For each 𝑖 ∈ {1, 2, . . . , 100} an each 𝑗 ∈ {1, 2, . . . , 200}, such that 𝑖 6 𝑗, let 𝐴𝑖 and 𝐵𝑗
be acquainted. All the other pairs of contestants are unfamiliar with each other. We
claim that this example has 𝑛 = 200, and that all the conditions of the problem are
satisfied.
Namely, there are no three contestants who all know each other, because no two
𝐴-contestants know each other and no two 𝐵-contestants know each other.
Moreso, for 𝑖 ∈ {1, 2, . . . , 100}, contestant 𝐴𝑖 knows contestants 𝐵𝑖 , 𝐵𝑖+1 , . . . , 𝐵200
and only them. Hence, he has exactly 201 − 𝑖 acquaintances, which means that there
are contestants knowing exactly 200, 199, . . . , 101 other contestants. Analogously, for
𝑗 ∈ {1, 2, . . . , 100}, contestant 𝐵𝑗 knows 𝐴1 , . . . , 𝐴𝑗−1 , 𝐴𝑗 and only them. This implies
that he has exactly 𝑗 acquaintances, which means that there are contestants knowing
exactly 1, 2, . . . , 100 other contestants.
4 Croatian Mathematical Olympiad
Day 1
A1. Let 𝑎, 𝑏 and 𝑐 be positive real numbers such that 𝑎 + 𝑏 + 𝑐 = 2. Prove that
(𝑎 − 1)2 (𝑏 − 1)2 (𝑐 − 1)2 1 𝑎2 + 𝑏2 𝑏2 + 𝑐2 𝑐2 + 𝑎2

(︂ )︂
+ + > + + .
𝑏 𝑐 𝑎 4 𝑎+𝑏 𝑏+𝑐 𝑐+𝑎
(Belarus 2017)
C1. Let 𝑛 be a positive integer. A good word is a sequence of 3𝑛 letters, in which

each of the letters 𝐴, 𝐵 and 𝐶 appears exactly 𝑛 times. Prove that for every
good word 𝑋 there exists a good word 𝑌 such that 𝑌 cannot be obtained from
𝑋 by swapping neighbouring letters fewer than 32 𝑛2 times. (IMO Shortlist 2017)
G1. Let 𝑘 be a circle centred at 𝑂. Let 𝐴𝐵 be a chord of that circle and 𝑀 its
midpoint. Tangents on 𝑘 at points 𝐴 and 𝐵 intersect at 𝑇 . The line ℓ goes
through 𝑇 , intersects the shorter arc 𝐴𝐵
¯ at the point 𝐶 and the longer arc 𝐴𝐵
¯
at the point 𝐷, so that |𝐵𝐶| = |𝐵𝑀 |.
Prove that the circumcentre of the triangle 𝐴𝐷𝑀 is the reflection of 𝑂 across
the line 𝐴𝐷. (Stipe Vidak)
N1. Determine all pairs (𝑚, 𝑛) of positive integers such that
2𝑚 = 7𝑛2 + 1. (Matko Ljulj)
***
Day 2
A2. Determine all functions 𝑓 : R → R such that
𝑓 (𝑥𝑓 (𝑦)) = (1 − 𝑦)𝑓 (𝑥𝑦) + 𝑥2 𝑦 2 𝑓 (𝑦)
holds for all real numbers 𝑥 and 𝑦. (Crux Mathematicorum)
C2. Let 𝑛 be a positive integer. Points 𝐴1 , 𝐴2 , . . . , 𝐴𝑛 are located on the inside of

a circle, and points 𝐵1 , 𝐵2 , . . . , 𝐵𝑛 are on the circle, so that the lines 𝐴1 𝐵1 ,
𝐴2 𝐵2 , . . . , 𝐴𝑛 𝐵𝑛 are mutually disjoint. A grasshopper can jump from point 𝐴𝑖
23
to point 𝐴𝑗 (for 𝑖, 𝑗 ∈ {1, . . . , 𝑛}, 𝑖 ̸= 𝑗) if and only if the line 𝐴𝑖 𝐴𝑗 does not go
through any of the inner points of the lines 𝐴1 𝐵1 , 𝐴2 𝐵2 , . . . , 𝐴𝑛 𝐵𝑛 .
Show that the grasshopper can take a series of jumps to get from any point 𝐴𝑖
to any point 𝐴𝑗 . (Russia 1994)
G2. Let 𝐴𝐵𝐶 be an acute-angled triangle such that |𝐴𝐵| < |𝐴𝐶|. Point 𝐷 is the
midpoint of the shorter arc 𝐵𝐶
¯ of the circumcircle of the triangle 𝐴𝐵𝐶. Point 𝐼
is the incentre of the triangle 𝐴𝐵𝐶, and point 𝐽 is the reflection of 𝐼 across
the line 𝐵𝐶. Line 𝐷𝐽 intersects the circumcircle of the triangle 𝐴𝐵𝐶 at the
point 𝐸 which lies on the shorter arc 𝐴𝐵.
¯
Prove that |𝐴𝐼| = |𝐼𝐸| holds. (Romania 2017)
N2. Let 𝑛 be a positive integer. Prove that there exists a positive integer 𝑘 such
that
51𝑘 − 17
is divisible by 2𝑛 .
***
Final test for MEMO team selection
A3. Let 𝑛, 𝑘, 𝑀 and 𝑎1 , 𝑎2 , . . . , 𝑎𝑛 be positive integers such that
1 1 1
+ + ··· + =𝑘 and 𝑎1 𝑎2 · · · 𝑎𝑛 = 𝑀.
𝑎1 𝑎2 𝑎𝑛
If 𝑀 > 1, prove that there does not exist a positive real number 𝑥 such that
𝑀 (𝑥 + 1)𝑘 = (𝑥 + 𝑎1 )(𝑥 + 𝑎2 ) · · · (𝑥 + 𝑎𝑛 ).
(IMO Shortlist 2017)
C3. Let 𝑎 > 2018 be a real number. There are 2018 bowls, each containing a finite
number of balls. It is known that the weight of each ball is of the form 𝑎𝑘 , where
𝑘 is an integer, and that the total weight of balls in any bowl is the same. Let
𝐵 denote the total number of occurrences of the most frequently used weight.
Determine the smallest possible value of 𝐵. (China 2005)
G3. Let 𝐴𝐵𝐶𝐷 be an isosceles trapezium with bases 𝐴𝐵 and 𝐶𝐷. The diagonals
of the trapezium meet at the point 𝑆, while 𝑀 denotes the midpoint of the
leg 𝐴𝐷. The circle circumscribed to the triangle 𝐵𝐶𝑀 intersects 𝐴𝐷 again at
the point 𝐾. Prove that the lines 𝑆𝐾 and 𝐴𝐵 are parallel.
Croatian Mathematical Olympiad 25
N3. Prove that, for every positive integer 𝑛 > 2, there exist positive integers 𝑎1 , 𝑎2 ,
. . . , 𝑎𝑛 such that for all 1 6 𝑖 < 𝑗 6 𝑛 the expression
𝑎𝑗 + 𝑎𝑖
𝑎𝑗 − 𝑎𝑖
is a positive integer. (Kvant)
***
Final test for IMO team selection
A4. Let 𝑃 (𝑥), 𝑄(𝑥) ∈ R[𝑥] be polynomials with real coefficients such that
2
𝑃 (𝑃 (𝑥)) = (𝑄(𝑥))
holds for all real numbers 𝑥.
Does there necessarily exist a polynomial 𝑅(𝑥) ∈ R[𝑥] with real coefficients such
2
that 𝑃 (𝑥) = (𝑅(𝑥)) holds for all real numbers 𝑥?
(Kürschák Mathematical Competition 2016)
C4. In the picture below a chain consisted of 54 unit squares is shown. Each unit
square, except for the two at the front and the end, is connected to its neigh-
bouring ones in opposite vertices.
...
It is allowed to put any unit square of the chain in any position in space as long
as it is connected to its neighbouring unit squares in corresponding vertices. Is
it possible for that chain to make the surface of a 3 × 3 × 3 cube? (Russia 1999)
G4. The incircle of the triangle 𝐴𝐵𝐶 is centred at 𝐼, and touches the sides 𝐵𝐶,
𝐶𝐴 and 𝐴𝐵 in points 𝐷, 𝐸 and 𝐹 , respectively. Let 𝑘 be a circle centred at 𝐴
passing through the point 𝐸. Let 𝐾 be the second intersection of the line 𝐷𝐸
with 𝑘. The line parallel to 𝐷𝐹 and passing through 𝐼 intersects the side 𝐴𝐵
at 𝑃 . The point 𝐿 is the intersection of the line 𝐶𝑃 with the circle 𝑘 such that
the point 𝑃 is located between points 𝐶 and 𝐿. The point 𝑂 is the circumcentre
of the triangle 𝐷𝐾𝐿.
Prove that the lines 𝐴𝐼 and 𝑂𝐷 are parallel. (Stipe Vidak)
N4. Determine all positive integers 𝑛 > 2 which satisfy the following condition:
For all integers 𝑎1 , 𝑎2 , . . . , 𝑎𝑛 such that their sum is not divisible by 𝑛, there
exists an integer 𝑖 ∈ {1, 2, . . . , 𝑛} such that none of the 𝑛 numbers
𝑎𝑖 , 𝑎𝑖 + 𝑎𝑖+1 , ..., 𝑎𝑖 + 𝑎𝑖+1 + · · · + 𝑎𝑖+𝑛−1
is divisible by 𝑛, where we define 𝑎𝑖 = 𝑎𝑖−𝑛 for the case 𝑖 > 𝑛.
(IMO Shortlist 2017)
4.1 Solutions
Day 1
A1. By the Cauchy–Bunyakovsky–Schwarz inequality, we have

(𝑎 − 1)2 (𝑏 − 1)2 (2 − 𝑎 − 𝑏)2 𝑐2
+ > = ,
𝑏 𝑐 𝑏+𝑐 𝑏+𝑐
and similar inequalities hold for all pairs. By adding the inequalities, we get
(𝑎 − 1)2 (𝑏 − 1)2 (𝑐 − 1)2
(︂ 2
𝑐2 𝑎2
)︂
1 𝑏
+ + > + + .
𝑏 𝑐 𝑎 2 𝑎+𝑏 𝑏+𝑐 𝑐+𝑎
Note that the initial claim follows from this, because
𝑏2 𝑐2 𝑎2 𝑎2 𝑏2 𝑐2
+ + = + + ,
𝑎+𝑏 𝑏+𝑐 𝑐+𝑎 𝑎+𝑏 𝑏+𝑐 𝑐+𝑎
which holds since
𝑏2 𝑐2 𝑎2 𝑎2 𝑏2 𝑐2 𝑏2 − 𝑎2 𝑐 2 − 𝑏2 𝑎2 − 𝑐2
+ + − − − = + +
𝑎+𝑏 𝑏+𝑐 𝑐+𝑎 𝑎+𝑏 𝑏+𝑐 𝑐+𝑎 𝑎+𝑏 𝑏+𝑐 𝑐+𝑎
= (𝑏 − 𝑎) + (𝑐 − 𝑏) + (𝑎 − 𝑐) = 0.
C1. Let us define the distance of good words 𝑋 and 𝑌 , denoted by 𝑑(𝑋, 𝑌 ), as the
smallest number of swaps of neighbouring letters necessary to obtain 𝑌 from 𝑋 (or
vice versa). Note that 𝑑(𝑋, 𝑌 ) = 𝑑(𝑌, 𝑋), and that for any three good words 𝑋, 𝑌
and 𝑍 we have
𝑑(𝑋, 𝑌 ) + 𝑑(𝑌, 𝑍) > 𝑑(𝑋, 𝑍).
Furthermore, for a good word 𝑋 denote by 𝐹 (𝑋) the number of pairs of positions
where the letter in the left position is lexicographically smaller than the one in the
right position, i.e. the number of pairs of the form 𝐴𝐵, 𝐴𝐶 or 𝐵𝐶. By swapping two
neighbouring letters in a good word 𝑋 we get a good word 𝑋 ′ . If the letters were
identical, those two words would be equal, so we can assume that all swaps involve
pairs of different letters. If we swap different letters, we have |𝐹 (𝑋) − 𝐹 (𝑋 ′ )| = 1.
From this, we can conclude that
𝑑(𝑋, 𝑌 ) > |𝐹 (𝑋) − 𝐹 (𝑌 )|
for any two good words 𝑋 and 𝑌 . Observe the good words
⏟ .⏞. . 𝐴 𝐵𝐵
𝑃 = 𝐴𝐴 ⏟ .⏞. . 𝐵 𝐶𝐶
⏟ .⏞. . 𝐶 and 𝑄 = 𝐶𝐶
⏟ .⏞. . 𝐶 𝐵𝐵
⏟ .⏞. . 𝐵 𝐴𝐴
⏟ .⏞. . 𝐴 .
𝑛 𝑛 𝑛 𝑛 𝑛 𝑛
Note that 𝐹 (𝑃 ) = 3𝑛2 and 𝐹 (𝑄) = 0, therefore 𝑑(𝑃, 𝑄) > 3𝑛2 .

Finally, for any good word 𝑋 we have
𝑑(𝑃, 𝑋) + 𝑑(𝑋, 𝑄) > 𝑑(𝑃, 𝑄) > 3𝑛2 .
Therefore, one of the good words 𝑃 and 𝑄 cannot be obtained from 𝑋 by swapping
fewer than 23 𝑛2 pairs of neighbouring letters.
G1. Since 𝐶 and 𝐷 are on 𝑘, the power of the point 𝑇 with respect to 𝑘 equals
|𝑇 𝐵|2 = |𝑇 𝐶| · |𝑇 𝐷|.
A
M′
C′ k
M O
T
ℓ
C
D
Furthermore, since the right-angled triangles 𝑇 𝐵𝑀 and 𝑇 𝑂𝐵 are similar, we have

|𝑇 𝐵|2 = |𝑇 𝑀 | · |𝑇 𝑂|. Therefore, |𝑇 𝐶| · |𝑇 𝐷| = |𝑇 𝑀 | · |𝑇 𝑂|, i.e. the quadrilateral
𝐶𝐷𝑂𝑀 is cyclic.
Let point 𝐶 ′ be the intersection of 𝑘 and the line 𝐷𝑀 , while 𝛼 = ^𝐶 ′ 𝑀 𝐶. Now we
have
1 1 1 1
^𝐶𝐶 ′ 𝑀 = ^𝐶𝐶 ′ 𝐷 = ^𝐶𝑂𝐷 = ^𝐶𝑀 𝐷 = (180∘ − ^𝐶 ′ 𝑀 𝐶) = 90∘ − 𝛼,
2 2 2 2
therefore ^𝑀 𝐶𝐶 ′ = 180∘ −𝛼−(90∘ − 12 𝛼) = 90∘ − 12 𝛼 = ^𝐶𝐶 ′ 𝑀 , i.e. |𝐶 ′ 𝑀 | = |𝐶𝑀 |,
meaning that 𝐶 ′ is the reflection of 𝐶 across the line 𝑂𝑀 , and |𝐴𝐶 ′ | = |𝐴𝑀 | holds.
Let 𝑀 ′ be the point on 𝑘 different from 𝐶 ′ such that |𝐴𝑀 ′ | = |𝐴𝐶 ′ |. Then
^𝑀 ′ 𝐷𝐴 = ^𝐶 ′ 𝐷𝐴 = ^𝑀 𝐷𝐴.
We can conclude that triangles 𝑀 𝐷𝐴 and 𝑀 ′ 𝐷𝐴 are congruent (two pairs of congru-
ent sides, one pair of congruent angles, and both are obtuse), so 𝑀 ′ is the reflection
of 𝑀 across the line 𝐴𝐷. The fact that 𝑂 is the circumcentre of the triangle 𝐴𝐷𝑀 ′
completes the proof.
N1. Note that 2𝑚 ≡ 1 (mod 7), which means that 𝑚 = 3𝑘 for some positive integer
𝑘. Now we have
23𝑘 − 1 = (2𝑘 − 1)(22𝑘 + 2𝑘 + 1) = 7𝑛2 .
Denote 𝐴 = 2𝑘 − 1 and 𝐵 = 22𝑘 + 2𝑘 + 1. Let 𝑑 be the greatest common divisor of 𝐴

and 𝐵, and note that 𝑑 is odd. Furthermore, 𝑑 divides 𝐵 − 𝐴2 = 2𝑘 + 2𝑘+1 = 3 · 2𝑘 ,
and since 𝑑 is odd, it follows that 𝑑 = 1 or 𝑑 = 3.
Therefore, we have exactly four possibilities for factorising 𝐴 and 𝐵. In all cases we
assume that 𝑎 and 𝑏 are relatively prime positive integers.
Case 1. 𝐴 = 7𝑎2 and 𝐵 = 𝑏2 . This is not possible because (2𝑘 )2 < 𝐵 < (2𝑘 + 1)2 , i.e.
𝐵 cannot be a perfect square.
Case 2. 𝐴 = 𝑎2 and 𝐵 = 7𝑏2 . If 𝑘 > 2, note that 𝐵 ≡ 1 (mod 4), i.e. 7𝑏2 ≡ 1
(mod 4), which is not possible. Therefore, 𝑘 = 1 and we get (𝑚, 𝑛) = (3, 1).
Case 3. 𝐴 = 21𝑎2 and 𝐵 = 3𝑏2 . Analogously to the previous case we can conclude that
𝑘 = 1 necessarily, but that is not possible in this case, since 21𝑎2 = 𝐴 = 21 − 1 = 1.
Case 4. 𝐴 = 3𝑎2 and 𝐵 = 21𝑏2 . Therefore, 𝐴 is divisible by 3, i.e. 2𝑘 ≡ 1 (mod 3),
from which it follows that 𝑘 = 2𝑙 for some positive integer 𝑙. Now we have
(2𝑙 − 1)(2𝑙 + 1) = 3𝑎2 ,
and since 2𝑙 − 1 and 2𝑙 + 1 are relatively prime, we have only two possibilities:
2𝑙 − 1 = 𝑐2 2𝑙 − 1 = 3𝑐2
or
2𝑙 + 1 = 3𝑑2 2𝑙 + 1 = 𝑑2 ,
where 𝑐 and 𝑑 are relatively prime positive integers.
In the first option, if 𝑙 > 2 we have 3𝑑2 ≡ 1 (mod 4), which is not possible. Therefore,
𝑙 = 1 and we get another solution (𝑚, 𝑛) = (6, 3).
In the second option, we have 2𝑙 = (𝑑 − 1)(𝑑 + 1). Since the greatest common divisor
of 𝑑 − 1 and 𝑑 + 1 is at most 2 and their product is a power of 2, we can conclude
that 𝑑 − 1 = 2, i.e. that 𝑙 = 3, but then 3𝑐2 = 23 − 1 = 7, which is not possible.
Finally, all solutions of the given equation are (𝑚, 𝑛) = (3, 1) and (𝑚, 𝑛) = (6, 3).
***
Day 2
A2. Let 𝑃 (𝑥, 𝑦) denote plugging 𝑥 and 𝑦 into the original equation. We have
𝑃 (0, 1) : 𝑓 (0) = 0,
𝑃 (1, 1) : 𝑓 (𝑓 (1)) = 𝑓 (1),
𝑃 (1, 𝑓 (1)) : 𝑓 (𝑓 (𝑓 (1))) = (1 − 𝑓 (1)) · 𝑓 (𝑓 (1)) + 𝑓 (1)2 · 𝑓 (𝑓 (1)).
By combining the second and the third equality we get
𝑓 (1) = (1 − 𝑓 (1)) · 𝑓 (1) + 𝑓 (1)3 , i.e. 𝑓 (1)2 = 𝑓 (1)3 .
From this we have two options: 𝑓 (1) = 1 or 𝑓 (1) = 0.

If 𝑓 (1) = 1, we get
𝑃 (𝑥, 1) : 𝑓 (𝑥) = 𝑥2 ,
so 𝑓 (𝑥) = 𝑥2 should hold for all real 𝑥. By plugging this into the original equation
we can conclude that this is not possible. Hence, 𝑓 (1) = 0 must hold.
Let 𝑐 be an arbitrary root of the function 𝑓 . We have
𝑃 (𝑥, 𝑐) : 0 = (1 − 𝑐)𝑓 (𝑥𝑐).
Therefore, if 𝑐 ̸= 1, 𝑓 (𝑐𝑥) = 0 must hold for all 𝑥 ∈ R. If 𝑐 ̸= 0 this implies that

𝑓 (𝑥) = 0 for all 𝑥 ∈ R. We check directly that 𝑓 ≡ 0 is indeed a possible solution of
the original equation.
Now assume that 𝑓 is not identically equal to 0. Calculations above show in that case
0 and 1 are the only roots of the function 𝑓 . Now we have
𝑃 (1, 𝑦) : 𝑓 (𝑓 (𝑦)) = (1 − 𝑦)𝑓 (𝑦) + 𝑦 2 𝑓 (𝑦) = (1 − 𝑦 + 𝑦 2 )𝑓 (𝑦), (1)
and for 𝑥 ̸= 0 (︂ )︂ (︂ )︂
1 𝑓 (𝑥)
𝑃 ,𝑥 : 𝑓 = 𝑓 (𝑥), (2)
𝑥 𝑥
since 𝑓 (1) = 0.
Let 𝑦1 , 𝑦2 ∈ R ∖ {0, 1} be such that 𝑓 (𝑦1 ) = 𝑓 (𝑦2 ) ̸= 0. Then from (1) it follows that
1 − 𝑦1 + 𝑦12 = 1 − 𝑦2 + 𝑦22 , i.e. (𝑦1 − 𝑦2 )(𝑦1 + 𝑦2 − 1) = 0.
We conclude that
𝑓 (𝑦1 ) = 𝑓 (𝑦2 ) =⇒ 𝑦1 = 𝑦2 or 𝑦1 + 𝑦2 = 1. (3)
By combining (2) and (3) we get that for all 𝑥 ̸= 0, 1 we have
𝑓 (𝑥) 𝑓 (𝑥)
= 𝑥 or + 𝑥 = 1,
𝑥 𝑥
i.e.
𝑓 (𝑥) = 𝑥2 or 𝑓 (𝑥) = 𝑥 − 𝑥2 .
Let 𝑥 ∈ R ∖ {0, 1} be such that 𝑓 (𝑥) = 𝑥2 . By plugging 𝑦 = 𝑥 into (1) we get
𝑓 (𝑥2 ) = (1 − 𝑥 + 𝑥2 )𝑥2 .
Now we have two cases: 𝑓 (𝑥2 ) = 𝑥4 and 𝑓 (𝑥2 ) = 𝑥2 − 𝑥4 . In the first case, we get
𝑥4 = (1 − 𝑥 + 𝑥2 )𝑥2 , from which we can easily conclude that 𝑥 = 0 or 𝑥 = 1. Since
we assumed 𝑥 ∈ / {0, 1}, this is not possible. In the second case, we get 𝑥2 − 𝑥4 =
(1 − 𝑥 + 𝑥 )𝑥 , from which we can conclude 𝑥 = 0 or 𝑥 = 12 . Again, we can dismiss
2 2
(︀ )︀2 (︀ )︀2
𝑥 = 0, and for 𝑥 = 12 we can note that 𝑓 ( 12 ) = 12 = 41 = 21 − 12 . This shows that
𝑓 (𝑥) = 𝑥 − 𝑥2 holds for all 𝑥 ̸= 0, 1. Since this formula holds for 𝑥 = 0, 1 as well, we
can conclude that
𝑓 (𝑥) = 𝑥 − 𝑥2 , ∀𝑥 ∈ R.
By plugging this directly into the original equation, we can confirm that this is indeed
a solution. Therefore, the only solutions of the original equation are 𝑓 = 0, ∀𝑥 ∈ R
and 𝑓 (𝑥) = 𝑥 − 𝑥2 , ∀𝑥 ∈ R.
C2. Let a path be any line 𝐴𝑖 𝐴𝑗 and a wall be any line 𝐴𝑘 𝐵𝑘 . We say that a path
and a wall intersect if the path goes through an inner point of the wall. A path is
good if there is no wall to intersect it, and a wall is irrelevant if it does not intersect
any path.
Claim 1. For any 𝑖 ∈ {1, 2, . . . , 𝑛} there exists at least one good path from point 𝐴𝑖 .
Proof. We will prove the claim for point 𝐴1 , and it holds analogously for all points 𝐴𝑖 .
Define the distance between a point 𝐴 and a wall 𝑤 as
min |𝐴𝑇 |.
𝑇 ∈𝑤
Since all walls are mutually disjoint, we know that none of the walls 𝐴2 𝐵2 , . . . , 𝐴𝑛 𝐵𝑛
contain point 𝐴1 . Let 𝐴𝑘 𝐵𝑘 be the wall closest to 𝐴1 . We claim that the path 𝐴1 𝐴𝑘 is
good. If we assume the contrary, that means that there exists a wall which intersects
𝐴1 𝐴𝑘 , but then this wall is closer to 𝐴1 than wall 𝐴𝑘 𝐵𝑘 , which is a contradiction.
Claim 2. There exists at least one irrelevant wall.
Proof. Without loss of generality, we can assume that points 𝐴1 , 𝐴2 , . . . , 𝐴𝑘 are the
vertices of the convex hull of {𝐴1 , 𝐴2 , . . . , 𝐴𝑛 }, and that they are labelled clockwise
in that order as the vertices of polygon 𝑃 = 𝐴1 𝐴2 . . . 𝐴𝑘 . If the wall 𝑤1 = 𝐴1 𝐵1 is
irrelevant, we are done. Therefore, assume that 𝑤1 intersects some path. That means
that this wall goes through the inner points of polygon 𝑃 , and since the walls are
mutually disjoint, we conclude that 𝑤1 must also intersect a path which is the side
of 𝑃 , because it cannot pass through any of the vertices of 𝑃 except 𝐴1 . Let 𝐶 be
the intersection of wall 𝑤1 and a side of 𝑃 . Consider the arc 𝐴 ˘ 1 𝐶 (clockwise from
point 𝐴1 to point 𝐶), and note that it contains points 𝐴2 , . . . , 𝐴𝑙 . We can repeat this
inference for wall 𝐴2 𝐵2 . Since all walls are mutually disjoint, its corresponding arc is
strictly smaller than the arc of 𝑤1 . Therefore, if all of the walls 𝐴2 𝐵2 , . . . , 𝐴𝑙−1 𝐵𝑙−1
are relevant, then wall 𝐴𝑙 𝐵𝑙 must surely be irrelevant.
Finally, we prove the problem statement by mathematical induction on 𝑛. The claim
obviously holds for 𝑛 = 1. Assume the claim holds for some positive integer 𝑛. For
𝑛 + 1 it follows from Claim 2 that there exists a point 𝐴𝑖 such that the wall 𝐴𝑖 𝐵𝑖
is irrelevant. By the inductive assumption, we can conclude that the claim holds for
all points except possibly point 𝐴𝑖 . However, by Claim 1, point 𝐴𝑖 is connected by a
good path with at least one of the remaining points, which proves the claim for 𝑛 + 1.
G2. Let 𝑂 be the circumcentre of the triangle 𝐴𝐵𝐶.
I
O
E
B C
J
D
Point 𝐷 lies on the angle bisector of ^𝐵𝐴𝐶. Therefore 𝐴, 𝐼 and 𝐷 are collinear.
Lines 𝐼𝐽 and 𝑂𝐷 are parallel, since they are both perpendicular to 𝐵𝐶.
We will prove the claim by showing that the triangles 𝐴𝑂𝐼 and 𝐸𝑂𝐼 are congruent.
First we show that the triangles 𝐴𝐼𝑂 and 𝐼𝐽𝐷 are similar. Note that ^𝐼𝐴𝑂 =
^𝐷𝐴𝑂 = ^𝑂𝐷𝐴 = ^𝑂𝐷𝐼 = ^𝐽𝐼𝐷. To show similarity, we need to prove that
|𝐴𝐼| : |𝐴𝑂| = |𝐼𝐽| : |𝐼𝐷|, i.e.
|𝐴𝐼| · |𝐼𝐷| = |𝐴𝑂| · |𝐼𝐽|. (1)
We have |𝐼𝐽| = 2𝑟 and |𝐴𝑂| = 𝑅, where 𝑟 and 𝑅 denote the incircle and the cir-
cumcircle radii, respectively. Therefore, the right-hand side of (1) equals 2𝑅𝑟. The
left-hand side product |𝐴𝐼| · |𝐼𝐷|, is in fact the power of point 𝐼 with respect to the
circumcircle of the triangle 𝐴𝐵𝐶 and equals 𝑅2 − |𝑂𝐼|2 . Now it suffices to verify
that 𝑅2 − |𝑂𝐼|2 = 2𝑅𝑟, which holds because of Euler’s theorem which expresses the
distance between the incentre and the circumcentre using this exact formula.
Therefore, we can conclude that the triangles 𝐴𝐼𝑂 and 𝐼𝐽𝐷 are similar. This means
that ^𝑂𝐼𝐴 = ^𝐷𝐽𝐼, and ^𝐷𝐼𝑂 = ^𝐼𝐽𝐸 follows. Since lines 𝐼𝐽 and 𝑂𝐷 are parallel,
we have ^𝐼𝐽𝐸 = ^𝑂𝐷𝐸, and since |𝑂𝐸| = |𝑂𝐷| we have ^𝑂𝐷𝐸 = ^𝐷𝐸𝑂. Now
having ^𝐷𝐼𝑂 = ^𝐷𝐸𝑂 we conclude that points 𝐷, 𝑂, 𝐼 and 𝐸 are concyclic.
From this we have ^𝐼𝑂𝐸 = ^𝐼𝐷𝐸, and from the proven similarity we have ^𝐼𝐷𝐸 =
^𝐼𝐷𝐽 = ^𝐴𝑂𝐼. It follows that ^𝐼𝑂𝐸 = ^𝐴𝑂𝐼. Since |𝐴𝑂| = |𝐸𝑂| and the side 𝑂𝐼
is mutual, we conclude that the triangles 𝐸𝑂𝐼 and 𝐴𝑂𝐼 are congruent.
N2. Claim. For every positive integer 𝑛 > 3 there exists a positive integer 𝑘 such
𝑛−2
that 512 − 1 = 2𝑛 · (2𝑘 + 1).
Proof. We prove the claim by mathematical induction on 𝑛.
For 𝑛 = 3 we have 512 − 1 ≡ 32 − 1 = 8 (mod 16), so 512 − 1 is divisible by 23 but
not by 24 , therefore the claim holds for 𝑛 = 3. Assume the claim holds for some 𝑛,
𝑛−2
i.e. 512 − 1 = 2𝑛 · (2𝑘 + 1) for some positive integer 𝑘. Then
𝑛−1 𝑛−2 𝑛−2
512 − 1 = (512 − 1)(512 + 1)
𝑛 𝑛
= 2 · (2𝑘 + 1)(2 · (2𝑘 + 1) + 2)
= 2𝑛+1 · (2𝑘 + 1)(2𝑛−1 (2𝑘 + 1) + 1),
and since (2𝑘 + 1)(2𝑛−1 (2𝑘 + 1) + 1) is odd, the claim holds for 𝑛 + 1. This completes
the proof.
Regarding the initial statement of the problem, we will inductively define an appro-
priate 𝑘𝑛 for every 𝑛. Note that for 𝑛 = 1, 𝑛 = 2 and 𝑛 = 3 we can select 𝑘 = 2, i.e.
𝑘1 = 𝑘2 = 𝑘3 = 2. Assume the claim holds for some 𝑛, i.e. there exists some positive
integer 𝑎𝑛 such that 51𝑘𝑛 − 17 = 2𝑛 · 𝑎𝑛 . If 𝑎𝑛 is even, we can select 𝑘𝑛+1 = 𝑘𝑛 . If 𝑎𝑛
is odd, we can define 𝑘𝑛+1 = 𝑘𝑛 + 2𝑛−2 . Then we have
𝑛−2 𝑛−2
51𝑘𝑛+1 − 17 = 512 · (51𝑘𝑛 − 17) + 17 · (512 − 1).
By the inductive assumption and the previously proven claim, we can conclude that
there exists a positive integer 𝑘 such that
𝑛−2
51𝑘𝑛+1 − 17 = 512 · 2𝑛 · 𝑎𝑛 + 17 · 2𝑛 · (2𝑘 + 1)
𝑛−2
= 2𝑛 · (512 𝑎𝑛 + 17(2𝑘 + 1)).
𝑛−2
Since 𝑎𝑛 is odd, it follows that 512 𝑎𝑛 + 17(2𝑘 + 1) is even, therefore 51𝑘𝑛+1 − 17 is
indeed divisible by 2𝑛+1 .
***
Final test for MEMO team selection
A3. Claim. For any positive integer 𝑎 and real number 𝑥 > 0 the following inequality
holds:
1
𝑎(𝑥 + 1) 𝑎 6 𝑥 + 𝑎,
where the equality is satisfied if and only if 𝑎 = 1.
Proof. If 𝑎 = 1, we easily see that the equality holds for all real numbers 𝑥 > 0.
Let us assume that 𝑎 > 1, and let us apply the inequality between arithmetic and
geometric means for 𝑥 + 1 and 𝑎 − 1 copies of 1:
𝑎−1
⏞ ⏟
(𝑥 + 1) + 1 + 1 + · · · + 1 √︀
> 𝑎 (𝑥 + 1) · 1𝑎−1 ,
𝑎
or equivalently,
1
𝑎(𝑥 + 1) 𝑎 6 𝑥 + 𝑎.
Notice that the equality is attained only if the equation 𝑥 + 1 = 1 is satisfied, which
is impossible due to the assumption 𝑥 > 0.
Let us now prove the original problem, using the above claim. We have
1 1 1
𝑀 (𝑥 + 1)𝑘 = 𝑎1 (𝑥 + 1) 𝑎1 𝑎2 (𝑥 + 1) 𝑎2 · · · 𝑎𝑛 (𝑥 + 1) 𝑎𝑛
6 (𝑥 + 𝑎1 )(𝑥 + 𝑎2 ) · · · (𝑥 + 𝑎𝑛 ),
where equality holds in case 𝑎1 = 𝑎2 = · · · = 𝑎𝑛 = 1. However, 𝑎1 𝑎2 · · · 𝑎𝑛 = 𝑀 > 1

so we conclude that this is not the case. Therefore, we conclude that the original
equation has no solutions in positive real numbers.
C3. The smallest value 𝐵 can attain is 2018.

Without loss of generality we can assume that the weight of the lightest ball is equal
to 1. If this is not the case, we can divide all the weights by the weight of the lightest
ball.
Let us assume that there are at most 2017 balls of each weight appearing in all the
bowls. Let 𝑛 be a non-negative integer such that 𝑎𝑛 is the weight of the heaviest ball.
Since there are at most 2017 balls of the weight 𝑎𝑛 , there exists at least one bowl
which does not contain any balls of weight 𝑎𝑛 , and moreover, all of the balls in that
bowl are lighter than 𝑎𝑛 . Thus, the total weight of balls in that bowl is at most
𝑛−1
∑︁ 𝑎𝑛 − 1 𝑎𝑛 − 1
2017 · 𝑎𝑘 = 2017 · 6 2017 · = 𝑎𝑛 − 1 < 𝑎𝑛 ,
𝑎−1 2017
𝑘=0
which leads to contradiction.

So, there exists at least one weight which appears at least 2018 times.
On the other hand, if we put a ball of weight 1 in each bowl, then all bowls contain
the same weight, while the weight 1 appears exactly 2018 times.
G3. Instead of the original formulation, we will solve the following equivalent prob-
lem: Let 𝐴𝐵𝐶𝐷 be an isosceles trapezium with bases 𝐴𝐵 and 𝐶𝐷, and let its
diagonals meet at the point 𝑆, as in the original formulation.
Additionally, let 𝐾 be a point on the line 𝐴𝐷 such that 𝑆𝐾 ‖ 𝐴𝐵, and let 𝑀 be the
other intersection of 𝐴𝐷 with the circle circumscribed to the triangle 𝐵𝐶𝐾. We need
to prove that 𝑀 is the midpoint of the leg 𝐴𝐷.
D C
K S
M′
M
T A B
Let 𝑀 ′ be a point on the line 𝐵𝐶 such that 𝑀 𝑀 ′ ‖ 𝐴𝐵, and let 𝑇 be the intersection
of the lines 𝐶𝐾 and 𝐴𝐵. Since the trapezium 𝐴𝐵𝐶𝐷 is isosceles and the quadrilateral
𝐵𝐶𝐾𝑀 is cyclic, we have ^𝐷𝐴𝑀 ′ = ^𝐶𝐵𝑀 = ^𝑀 𝐾𝑇 , and therefore 𝐴𝑀 ′ ‖ 𝑇 𝐶.
Using similarity of triangles, we obtain |𝐴𝑇 | : |𝐶𝐷| = |𝐾𝐴| : |𝐾𝐷| = 𝑑(𝑆, 𝐴𝐵) :
𝑑(𝑆, 𝐶𝐷) = |𝐴𝐵| : |𝐶𝐷|. Hence |𝐴𝑇 | = |𝐴𝐵| and |𝑀 ′ 𝐵| = |𝑀 ′ 𝐶|. Thus the
point 𝑀 ′ is the midpoint of the leg 𝐵𝐶 and, of course, 𝑀 is the midpoint of the
leg 𝐴𝐷.
N3. We will prove the claim using mathematical induction on 𝑛. We will call the set
{𝑎1 , 𝑎2 , . . . , 𝑎𝑛 } good if it satisfies the given condition.
For 𝑛 = 2 the set {1, 2} is clearly good. Let us assume that for some positive integer
𝑛 > 2 there exists a good set {𝑎1 , 𝑎2 , . . . , 𝑎𝑛 }. Let 𝑎 be the least common multiple of
the set
{𝑎1 , 𝑎2 , . . . , 𝑎𝑛 } ∪ {𝑎𝑗 − 𝑎𝑖 | 1 6 𝑖 < 𝑗 6 𝑛}.
We claim that the set {𝑎, 𝑎 + 𝑎1 , 𝑎 + 𝑎2 , . . . , 𝑎 + 𝑎𝑛 }, containing 𝑛 + 1 elements, is also

good.
Notice that for all 𝑖 ∈ {1, 2, . . . , 𝑛} we have
(𝑎 + 𝑎𝑖 ) + 𝑎 2𝑎 + 𝑎𝑖 𝑎
= = 2 + 1,
(𝑎 + 𝑎𝑖 ) − 𝑎 𝑎𝑖 𝑎𝑖
which is a positive integer since 𝑎 is divisible by 𝑎𝑖 (by definition).
Moreover, for all 1 6 𝑖 < 𝑗 6 𝑛 we have
(𝑎 + 𝑎𝑗 ) + (𝑎 + 𝑎𝑖 ) 2𝑎 + (𝑎𝑗 + 𝑎𝑖 ) 𝑎 𝑎𝑗 + 𝑎𝑖
= =2 + ,
(𝑎 + 𝑎𝑗 ) − (𝑎 + 𝑎𝑖 ) 𝑎𝑗 − 𝑎𝑖 𝑎𝑗 − 𝑎𝑖 𝑎𝑗 − 𝑎𝑖
which is a positive integer as well.
This completes the inductive step, thereby proving the claim.
***
Final test for IMO team selection
A4. Yes, there necessarily exists such polynomial 𝑅(𝑥).

Firstly, notice that we are allowed to assume, without loss of generality, that polyno-
mials 𝑃 (𝑥) and 𝑄(𝑥) have leading coefficient equal to 1. If the polynomial 𝑄(𝑥) is
constant, then the polynomial 𝑃 (𝑥) is constant as well, and we have 𝑃 (𝑥) = (𝑄(𝑥))2 .
Therefore, let us assume that the polynomial 𝑄(𝑥) is not constant, and neither the
polynomial 𝑃 (𝑥). The following equality holds for degrees of polynomials 𝑃 (𝑥) and
𝑄(𝑥):
(deg 𝑃 )2 = 2 deg 𝑄.
Thus, there exists a positive integer 𝑛 such that deg 𝑃 = 2𝑛 and deg 𝑄 = 2𝑛2 . That
means there exist polynomials 𝑅(𝑥) and 𝑆(𝑥) with real coefficients such that
𝑃 (𝑥) = (𝑅(𝑥))2 + 𝑆(𝑥), ∀𝑥 ∈ R,
and their coefficients satisfy deg 𝑅 = 𝑛 and deg 𝑆 < 𝑛. Let us define
𝐴(𝑥) = 𝑅(𝑃 (𝑥)) and 𝐵(𝑥) = 𝑆(𝑃 (𝑥)), ∀𝑥 ∈ R.
Then we have
𝐵(𝑥) = (𝑄(𝑥))2 − (𝐴(𝑥))2 = (𝑄(𝑥) − 𝐴(𝑥))(𝑄(𝑥) + 𝐴(𝑥)), ∀𝑥 ∈ R.
We also have deg 𝐴 = 2𝑛2 = deg 𝑄, so if the polynomial 𝐵(𝑥) is not the null polyno-
mial, then its degree is greater than or equal to 2𝑛2 . However, it is impossible due to
the fact that degree of the polynomial 𝐵(𝑥) is at most (𝑛 − 1) · 2𝑛 = 2𝑛2 − 2𝑛 < 2𝑛2 .
Thus, polynomial 𝐵(𝑥) is the null polynomial, and since the polynomial 𝑃 (𝑥) is not
equal to 0, we conclude that the polynomial 𝑆(𝑥) is not null polynomial. In other
words, we have 𝑃 (𝑥) = (𝑅(𝑥))2 for all real numbers 𝑥.
C4. No, it is not possible.

Let us assume the opposite, i.e. that the chain fully covers the surface of a 3 × 3 × 3
cube. Let us draw a diagonal joining two opposite vertices which are two meeting
points of the chain in each unit square of the chain (including the first and the last
unit square in the chain as well). After that, we colour vertices which are the meeting
points of the chain in black, and other ones in white.
In this manner we got polyline (possibly intersecting itself) on the surface of the
original cube. Notice that the degree of all vertices on that polyline is even, except
for the first and the last one. Namely, each vertex is connected to exactly two other
vertices, while the boundary ones are connected to one. More precisely, all black
vertices, except for the two boundary vertices, have degree equal to 4, while two
boundary black vertices have degree equal to 3 or 4, depending on the case if we end
the polyline in the same point from which we started it.
Now, observe the cube and notice that four of its vertices are black. Since each of
those vertices has degree equal to 3, we have at least four vertices with odd degree,
which leads to contradiction.
G4. We easily see that ^𝐴𝐾𝐸 = ^𝐾𝐸𝐴 = ^𝐷𝐸𝐶 = ^𝐶𝐷𝐸. Thus |𝐴𝐾| = |𝐴𝐸|
and 𝐴𝐾 ‖ 𝐶𝐷.
K
E
D
I
O
A P F B
L′ ≡ L
Let 𝐿′ be the intersection of the lines 𝐶𝑃 and 𝐴𝐾. Since the triangles 𝑃 𝐵𝐶 and
𝑃 𝐴𝐿′ are similar, by trigonometric calculus we get |𝐵𝑃 | : |𝐴𝑃 | = |𝐵𝐶| : |𝐴𝐿′ |, from
which it follows that |𝐴𝐿′ | = |𝐴𝐾| = |𝐴𝐸|, i.e. 𝐿′ lies on the circle 𝑘 – so it must be
𝐿′ ≡ 𝐿. Similarly, we can show that 𝐷, 𝐹 and 𝐿 are collinear.
Now we know that 𝐾𝐿 is the diameter of the circle 𝑘. Observing the triangles 𝐴𝐾𝑂
and 𝐸𝐴𝐼, we notice they are both right-angled, and ^𝐴𝐾𝑂 = 90∘ − ^𝐾𝑂𝐴 =
90∘ − 21 ^𝐾𝑂𝐿 = 90∘ − ^𝐾𝐷𝐿 = ^𝐼𝐴𝐸 holds. Hence they are congruent, which
means that segments 𝐴𝑂 and 𝐼𝐷 are parallel (since they are perpendicular to 𝐾𝐿
and 𝐵𝐶, respectively) and have equal length (|𝐼𝐷| = |𝐼𝐸| = |𝑂𝐴|). Therefore, the
quadrilateral 𝐴𝑂𝐷𝐼 is a parallelogram, from which it follows that 𝐴𝐼 ‖ 𝑂𝐷.
N4. All such numbers are primes.

Let 𝑛 be a composite number, i.e. 𝑛 = 𝑎𝑏, where 𝑎 > 2 and 𝑏 > 2 are positive integers.
Observe the sequence
0, 𝑏, 𝑏, . . . , 𝑏,
in which the number 𝑏 is appearing 𝑎𝑏 − 1 times. The sum of all numbers in that
sequence is 𝑎𝑏2 − 𝑏, which is not divisible by 𝑛 = 𝑎𝑏. However, notice that, no
matter on the initial index of the sequence, the sum of 𝑎 (or 𝑎 + 1, if we pass through
element 0 of the sequence) consecutive numbers in the sequence will be equal to 𝑎𝑏,
and therefore divisible by 𝑛 = 𝑎𝑏.
Let 𝑛 = 𝑝 be a prime number. Let us assume the opposite: there exist positive
integers 𝑎1 , 𝑎2 , . . . , 𝑎𝑝 which all add up to a number not divisible by 𝑝, but for all
𝑖 ∈ {1, 2, . . . , 𝑝} there exists 𝑗 ∈ {𝑖 + 1, 𝑖 + 2, . . . , 𝑖 + 𝑝 − 1} such that the number
𝑎𝑖 + 𝑎𝑖+1 + · · · + 𝑎𝑗−1 is divisible by 𝑝. Reminder: all operations on indices are made
using convention 𝑎𝑖 = 𝑎𝑖−𝑝 for 𝑖 > 𝑝.
Let us now make a graph consisted of 𝑝 vertices (indicating numbers 𝑎1 , 𝑎2 , . . . , 𝑎𝑝 ).
The two vertices 𝑎𝑖 and 𝑎𝑗 are joined with directed edge if the sum 𝑎𝑖 +𝑎𝑖+1 +· · ·+𝑎𝑗−1
is divisible by 𝑝. Due to the assumption, from any vertex there is at least one edge
incident to that vertex. Since there are only finitely many vertices in the graph, we
conclude that the graph has a cycle.
Consider that cycle and let us sum up all sums which correspond to edges of that
cycle. Notice that all numbers 𝑎1 , 𝑎2 , . . . , 𝑎𝑝 appear equally many times in those sums,
and let us denote that number of occurrence by 𝑘. Moreover, in that cycle we have
at most 𝑝 edges, and for each edge the corresponding sum consists of at most 𝑝 − 1
addends, since the sum of all numbers in the original sequence is not divisible by 𝑝.
Hence, 𝑘 6 𝑝 − 1. However, each of those sums along the edges of the cycle is divisible
by 𝑝, so the sum of all those sums in the cycle is 𝑝 as well, and we have
𝑝 | 𝑘(𝑎1 + 𝑎2 + · · · + 𝑎𝑝 ).
This gives contradiction, since 𝑘 < 𝑝, i.e. 𝑝 - 𝑘 and 𝑝 - 𝑎1 + 𝑎2 + · · · + 𝑎𝑝 .

5 Croatian Junior Mathematical Olympiad
A1. Prove that

3𝑎𝑏𝑐 + 𝑎 + 𝑏 + 𝑐 > 2(𝑎𝑏 + 𝑏𝑐 + 𝑐𝑎)
holds for all real numbers 𝑎, 𝑏, 𝑐 > 1.
Determine all cases for which the equality is obtained.
(Junior Olympiad of Malaysia 2015)
C1. One hundred people attended the party, some of whom were previously acquain-
ted. All acquaintances were mutual and no new were made during the party.
A gong rang 100 times during the party. After the first sounding of the gong, all
the people not acquainted with anyone left the party. After the second sounding
of the gong, all the people with exactly one acquaintance (among the remaining
people) left. It continued all the way, meaning that after the 𝑘 th sounding of
the gong, all the people acquainted with exactly 𝑘 − 1 remaining people left the
party (𝑘 = 1, . . . , 100).
At the end of the party, there were 𝑛 people still present. Find all possible
values of 𝑛.
G1. Let 𝐴𝐵𝐶𝐷 be a square, and let 𝑘 be the circle centred at 𝐵 passing through 𝐴,
𝐶 and the point 𝑇 inside the square. Tangent on 𝑘 at 𝑇 intersects the segments
𝐶𝐷 and 𝐷𝐴 at 𝐸 and 𝐹 , respectively. Let 𝐺 and 𝐻 be the intersections of the
lines 𝐵𝐸 and 𝐵𝐹 with the segment 𝐴𝐶, respectively.
Prove that the lines 𝐵𝑇 , 𝐸𝐻 and 𝐹 𝐺 are passing through the same point.
N1. Find all positive integers 𝑛 > 2 for which odd positive integers 𝑎1 , 𝑎2 , . . . , 𝑎𝑛
exist (not necessarily distinct) such that
𝑎21 + 𝑎22 + · · · + 𝑎2𝑛
is a square of some positive integer. (Ilko Brnetić)
5.1 Solutions
A1. Let us denote 𝑥 = 𝑎 − 1, 𝑦 = 𝑏 − 1 and 𝑧 = 𝑐 − 1. Then 𝑥, 𝑦, 𝑧 > 0, and the given

inequality easily transforms into
3𝑥𝑦𝑧 + 𝑥𝑦 + 𝑦𝑧 + 𝑧𝑥 > 0,
which is true since all addends on the left-hand side are non-negative.
37
38 Croatian Junior Mathematical Olympiad
The equality is obtained if and only if 𝑥𝑦𝑧 = 𝑥𝑦 = 𝑦𝑧 = 𝑧𝑥 = 0, which is true if and

only if at least two numbers among 𝑥, 𝑦 and 𝑧 are equal to 0, i.e. if and only if at
least two numbers among 𝑎, 𝑏 and 𝑐 are equal to 1.
C1. We show that 𝑛 can be 0, 1, 2, 3, . . . , 98. The following contains the description
of a situation in which exactly 𝑛 people are present after the last chime (for 𝑛 =
0, 1, 2, . . . , 98):
For 𝑛 > 0, we can divide all the people at the party into two groups, 𝐴 and 𝐵. Let
𝐴 contain 𝑛 people and assume every one of them is acquainted with all the other
people at the party. Let 𝐵 contain the remaining 100 − 𝑛 people, none of whom are
acquainted amongst themselves, but all of whom are acquainted with all the people
in group 𝐴 (thus, every person in group 𝐵 has 𝑛 acquaintances).
All the people from group 𝐵 will obviously leave the party after the (𝑛+1)th sounding
of the gong. After that, only people from group 𝐴 will remain, and each of them will
have exactly 𝑛 − 1 acquaintances. As the gong has already been sounded 𝑛 times,
this means none of them will leave until the end of the party.
The value 𝑛 = 0 is attained, for example, when all the party-goers know each other
(so they all leave after the 100th chime). A simple observation shows that at least one
person must leave at some moment: this is the person with the fewest acquaintances.
This implies that 𝑛 = 100 cannot be attained.
Finally, let us prove that 𝑛 = 99 is not possible. Assume the contrary, i.e. that exactly
one person will leave the party before it ends; call this person 𝑋. As the first one to
leave, this is obviously the person with the fewest acquaintances. Since none of the
remaining people leave after 𝑋, we conclude that all of them must be acquainted with
𝑋 – if another person 𝑌 is not acquainted with 𝑋, then the number of people they
know would not change with 𝑋 leaving, so they would have to leave at some point
as well. This shows that 𝑋 has 99 acquaintances, which contradicts the assumption
that 𝑋 has the fewest acquaintances.
G1. Note that the lines 𝐹 𝐴 and 𝐹 𝑇 are tangent to the circle 𝑘, hence |𝐹 𝐴| = |𝐹 𝑇 |,
and the triangles 𝐴𝐵𝐹 and 𝑇 𝐵𝐹 are congruent. Analogously, |𝐸𝐶| = |𝐸𝑇 |, and the
triangles 𝐶𝐵𝐸 and 𝑇 𝐵𝐸 are congruent.
D E C
T
G
H
k
A B
Croatian Junior Mathematical Olympiad 39
Let us denote 𝛼 = ^𝐹 𝐵𝐴 = ^𝐹 𝐵𝑇 and 𝛽 = ^𝐸𝐵𝐶 = ^𝐸𝐵𝑇 . Since ^𝐴𝐵𝐶 = 90∘ ,

it follows that 𝛼 + 𝛽 = 45∘ . Now we have ^𝐴𝐹 𝐵 = 90∘ − 𝛼 = 45∘ + 𝛽 and ^𝐴𝐺𝐵 =
^𝐺𝐵𝐶 + ^𝐵𝐶𝐴 = 𝛽 + 45∘ , i.e. ^𝐴𝐹 𝐵 = ^𝐴𝐺𝐵.
Hence, the quadrilateral 𝐴𝐵𝐺𝐹 is cyclic, and ^𝐵𝐺𝐹 = 180∘ − ^𝐵𝐴𝐹 = 90∘ , i.e.
𝐹 𝐺 ⊥ 𝐵𝐸. Similarly, the quadrilateral 𝐵𝐶𝐸𝐻 is cyclic, and 𝐸𝐻 ⊥ 𝐵𝐹 .
Since the segments 𝐹 𝐺 and 𝐸𝐻 are the altitudes of the triangle 𝐵𝐸𝐹 , so as the
segment 𝐵𝑇 , we finally conclude that the lines 𝐵𝑇 , 𝐸𝐻 and 𝐹 𝐺 are passing through
the same point – the orthocentre of the triangle 𝐵𝐸𝐹 .
N1. We will use the following facts in solving the problem:

i) If 𝑚 is even number, then 𝑚2 is divisible by 4.
ii) If 𝑚 is odd number, then 𝑚2 gives remainder 1 when divided by 8.
The first statement is obvious, while the latter holds because 𝑘(𝑘 − 1) is even for any
integer 𝑘, and (2𝑘 − 1)2 = 4𝑘(𝑘 − 1) + 1.
According to i) and ii), every square of an integer gives remainder 0, 1 or 4 when
divided by 8.
On the other hand, according to ii), 𝑎21 + 𝑎22 + · · · + 𝑎2𝑛 gives the same remainder as
the number 𝑛 when divided by 8.
Thus, it follows that 𝑛 must give remainder 0, 1 or 4 when divided by 8, and we show
that all such 𝑛 are the solutions:
1) For 𝑛 giving remainder 0 or 4 when divided by 8, i.e. 𝑛 = 4𝑡, 𝑡 ∈ N, let 𝑎1 =
· · · = 𝑎𝑛−1 = 1 and 𝑎𝑛 = 2𝑡 − 1. Then
𝑎21 + 𝑎22 + · · · + 𝑎2𝑛 = (𝑛 − 1) · 12 + (2𝑡 − 1)2 = 4𝑡 − 1 + 4𝑡2 − 4𝑡 + 1 = (2𝑡)2 .
2) For 𝑛 = 8𝑡 + 1, 𝑡 ∈ N, let 𝑎1 = · · · = 𝑎𝑛−1 = 1 and 𝑎𝑛 = 2𝑡 − 1. Then
𝑎21 + 𝑎22 + · · · + 𝑎2𝑛 = (𝑛 − 1) · 12 + (2𝑡 − 1)2 = 8𝑡 + 4𝑡2 − 4𝑡 + 1 = (2𝑡 + 1)2 .

○
c Croatian Mathematical Society, 2018
Editors:
Ivan Kokan, Petar Bakić
Translation:
Nikola Adžaga, Petar Bakić, Matija Bašić,
Ivan Kokan, Ivan Krijan, Matko Ljulj, Azra Tafro
Figures and typesetting:

Ivan Kokan
Printed in:
Element Ltd.
June 2018, Zagreb, Croatia
Published in 250 copies

Arithmetika Horvatszka, the First Croatian Mathematics Book
Arithmetika Horvatszka (literally, Croatian Arithmetic) was published in Zagreb in 1758. It was the
first mathematics textbook in Croatian. The author Mijo (Mihalj) Šilobod Bolšić (1724–1787) was a
cultural and scientific activist, teacher, poet and priest. He studied philosophy in Vienna and theology
in Bologna and Zagreb. The growing needs in trade, money exchange and economy at the time forced
the teachers to pay more attention to doing calculations. However, the only handbooks available in
the Austro-Hungarian Empire at the time were written in Latin, German or Hungarian. This is why
Šilobod decided to write an arithmetic textbook in Croatian. In fact, the book was written in the old
Kajkavian dialect.
Šilobod’s book was not a formal textbook, but was intended for a wider audience: pupils and
students, merchants, businessmen and tradesmen, housewives, peasants, servants, soldiers, workers
and others. The book was written in the form of a dialogue between teacher and reader, asking
questions. For example: If you know that a book and a pen cost together 110 (say, dollars) and the
book costs 100 more than the pen, tell me as quick as you can what is the cost of the pen. (The answer
is not 10, as some of your friends might say.)
This book achieved tremendous success among the common people. After making calculations and
completing a deal with merchants, people would often say: This would be in accordance with Šilobod.
The book has four main parts: 1) Simple counting (it deals with the four basic operations with
natural numbers and zero), 2) Operations with fractions (rational numbers), 3) The rule of three (lat. de
regula trium) – basic and advanced, 4) Various calculations. The rule of three is a method for solving
equations which can nowadays be solved instantaneously by a computer. However, at the time they
were not considered an easy task for students. In its simplest form, the rule of three gives the solution to
an equation a / b = c / x for x. A typical example is as follows: The worker A can dig a canal in 15 days,
while for worker B it takes 10 days to complete the same task. How many days does it take for A and B
to do the same job if they are working together? (Answer: 6.) In part 4 the book considers sequences
(particularly, arithmetic and geometric progressions), permutations (e.g. why there are 5! = 120 ways
for five people to stand in order), combinations (e.g. why there are 20 ways to choose three out of six
people) etc. – the basics of modern combinatorics. In addition, there are some logic puzzles. An easy
example is as follows: Two fathers and two sons caught three rabbits, and each got one rabbit. Tell me,
how is this possible? (Answer: grandfather, son and grandson.)
In conclusion, we might say that this book, one of the first of its kind in the South East Europe, had
an immense impact on the basic knowledge and arithmetic skills of people in Croatia and neighbouring
countries. As a cultural and historical heritage, the book was reprinted in 2008.
Let us mention that also in 1758, Ruđer Bošković (1711–1787), the famous Croatian mathematician, physicist,
astronomer and philosopher from the city of Dubrovnik, published in Vienna his well-known book (written in Latin):
A Theory of Natural Philosophy. The second edition appeared in Venice in 1763. The first English edition was published
in 1922, whereas the Croatian translation appeared in 1974. Bošković worked as a university professor in Rome, Milan,
Pavia and Paris. The famous German physicist and Nobel laureate Werner Heisenberg once said: Bošković is the Croatian
Leibniz.
Darko Veljan

HRV ABooklet 2018

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

HRV ABooklet 2018

Uploaded by

Copyright:

Available Formats

MATHEMATICAL

Croatian Mathematical Society

Mathematical competitions in Croatia in 2018 i

1 First round – City competition 1

2 Second round – County competition 5

3 Final round – National competition 8

4 Croatian Mathematical Olympiad 23

5 Croatian Junior Mathematical Olympiad 37

In this booklet we present the problems from mathematical competitions for

1.4. Determine all pairs (𝑥, 𝑦) of real numbers such that 𝑥 + 𝑦 = 𝑥2 + 𝑦 2 = 𝑥3 + 𝑦 3 .

2.1. Find all complex numbers 𝑧 such that

2.3. Determine all triples (𝑝, 𝑞, 𝑟) of prime numbers such that

2.4. Determine all pairs (𝑥, 𝑦) of real numbers such that

3.1. Determine all real numbers 𝑥 such that

3.2. Four cubes with edges of length 1, 2, 3

3.3. Determine all real numbers 𝑥 such that

(𝑥 − 1009)3 + (2𝑥 − 1009)3 + (2018 − 3𝑥)3 = 0. (Ratko Višak)

4.6. Let 𝑎1 , 𝑎2 , . . . , 𝑎41 be an arithmetic sequence such that

4.7. There are 27 common 1 × 1 × 1 playing dice marked with

1.2. Determine all pairs (𝑚, 𝑛) of integers such that

𝑎+𝑏 𝑏+𝑐 𝑐+𝑎

2.1. Let 𝑧 be a complex number such that

Prove that 𝑧 is a real number.

has integer solutions.

3.2. Let 𝑎, 𝑏 and 𝑐 be positive real numbers such that

Determine the ratio 𝑏 : 𝑐. (Hong Kong 2002)

4.2. Let 𝑛 be a positive integer. Prove that

1.1. Determine all triples (𝑥, 𝑦, 𝑧) of real numbers that satisfy

1.2. Let 𝐷0 , 𝐷1 , . . . , 𝐷2018 be points on the segment 𝐴𝐵 such that 𝐷0 = 𝐴, 𝐷2018 =

|𝐶𝐷0 |2 + |𝐶𝐷1 |2 + · · · + |𝐶𝐷2018 |2 = |𝐴𝐷1 |2 + |𝐴𝐷2 |2 + · · · + |𝐴𝐷2018 |2 .

1.3. Let 𝑝 be a prime number and let 𝑛 > 𝑝 − 1 be an integer. If 𝑛𝑝 + 1 is a perfect

1.5. We say that a circular arrangement of positive integers is alternating if every

2.2. Branko is writing a sequence of quadratic polynomials with real coefficients. In

2.5. An 𝑛 × 𝑛 square board is given, where 𝑛 is an odd positive integer. Each of

3.1. Prove the identity

4.3. Let 𝑓 : N → N be a function such that

There are now two cases: 𝑧 = 1 or 𝑥 − 𝑦 + 𝑧 + 1 = 0.

C = E2018 ··· ··· A = D0 = E0

From here we get |𝐶𝐸𝑖 | = |𝐴𝐸2018−𝑖 | for 𝑖 = 1, 2, . . . , 2017.

By subtracting these two equalities, we get

|𝐶𝐷𝑖 |2 − |𝐴𝐷𝑖 |2 = |𝐶𝐸𝑖 |2 − |𝐴𝐸𝑖 |2 , 𝑖 = 1, . . . , 2017,

and the same relation also holds for 𝑖 = 0 and 𝑖 = 2018.

|𝐶𝐷0 |2 + |𝐶𝐷1 |2 + · · · + |𝐶𝐷2018 |2 − |𝐴𝐷0 |2 − |𝐴𝐷1 |2 − · · · − |𝐴𝐷2018 |2

Since |𝐴𝐷0 | = 0, this proves the claim.

1.3. Let 𝑎 be a positive integer such that 𝑛𝑝 + 1 = 𝑎2 . Note that 𝑎 > 1.

i) Let 𝑝 | 𝑎 − 1, i.e. let 𝑎 = 𝑘𝑝 + 1 for some integer 𝑘.

1.5. Let 𝑎, 𝑝, 𝑞 and 𝑏 be four consecutive numbers in an alternating arrangement.

𝑎 = 18 . . . 18, 𝑏 = 72 . . . 72, 𝑎 + 𝑏 = 90 . . . 90,

𝑎(𝑥 + 𝑑)2 + 𝑏(𝑥 + 𝑑) + 𝑐 = 𝑎𝑥2 + (2𝑎𝑑 + 𝑏)𝑥 + (𝑎𝑑2 + 𝑏𝑑 + 𝑐)

(2𝑎𝑑 + 𝑏)2 − 4𝑎(𝑎𝑑2 + 𝑏𝑑 + 𝑐) = 4𝑎2 𝑑2 + 4𝑎𝑏𝑑 + 𝑏2 − 4𝑎2 𝑑2 − 4𝑎𝑏𝑑 − 4𝑎𝑐 = 𝑏2 − 4𝑎𝑐.

The discriminant of the initial polynomial 𝑥2 −2𝑥−1 is 8, while the discriminant

2.3. Denote by 𝑃 and 𝑄 the midpoints of 𝐵𝐶 and 𝐴𝐷, respectively.

We will show that the quadrilateral 𝐴𝐵𝑁 𝑀 is cyclic.

^𝑀 𝐴𝐵 = ^𝐷𝑄𝑃 = 180∘ − ^𝑃 𝑄𝑀 = ^𝑀 𝑁 𝑃 = 180∘ − ^𝐵𝑁 𝑀,

which is enough to conclude that the quadrilateral 𝐴𝐵𝑁 𝑀 is cyclic.

2.4. Let 𝑛 be a positive integer such that

𝑝 + 2𝑝−1 = 𝑛2 , i.e. 𝑝 = 𝑛2 − 22𝑘 = (𝑛 − 2𝑘 )(𝑛 + 2𝑘 ).

Subtracting these two equalities, we get

is divisible by 3 (because 4𝑙 gives remainder 1 when divided by 3). We conclude that

3.1. Using the identity

Transforming the expression in the second parenthesis yields

Now we can extend 𝑆 with −95 because it is the root of 𝑥 + 95.