MATHEMATICAL

COMPETITIONS
I N C R O A T I A

Croatian Mathematical Society

Zagreb, 2015

c Croatian Mathematical Society, 2015

Editor:
Matija Bašić

Translation:
Matija Bašić, Ivan Kokan, Kristina Ana Škreb,
Azra Tafro, Stipe Vidak, Vanja Wagner

Figures and typesetting:

Ivan Kokan

July 2015, Zagreb, Croatia

 Mathematical competitions in Croatia in 2015

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 2015, 16881 students participated in the first round of the competitions,
among them 1050 in category A for secondary schools. The city competitions were
held on 29th of 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 27th of February, 2198 primary school students
and 1246 secondary school students (539 of them in category A) participated. The
best 83 students from primary school (from 5th to 8th grade), and 163 secondary
school students (91 in category A and 72 in category B) were invited to the National
competition in Trogir (from 8nd to 10th of April).
After the National competition, an additional three-round Team selection process,
called Croatian Mathematical Olympiad, was organised. The top 19 students from
category A in the National competition took two tests on 18th and 19th of April.
Separate final selection tests for the IMO and MEMO teams took place on 25th
of April. 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 56th International
Mathematical Olympiad (IMO) in Chiang Mai, Thailand and the 9th Middle
European Mathematical Olympiad (MEMO) in Koper, Slovenia were selected:

IMO
1
Adrian Beker (grade 10)
Ivan Lazarić 2 (grade 12)
Lukas Novak 3 (grade 10)
Petar Orlić 1 (grade 11)
Daniel Paleka 4 (grade 11)
Kristijan Štefanec 1 (grade 12)
MEMO
Domagoj Bradač 1 (grade 11)
Josip Kelava 5 (grade 10)
Andrija Mandić 1 (grade 11)
Petar Nizić-Nikolac 1 (grade 9)
Patrik Papac 6 (grade 10)
Leon Starešinić 1 (grade 11)

1
XV. gimnazija, Zagreb, 2 Gimnazija Pula, Pula, 3 Gimnazija Josipa Slavenskog,
Čakovec, 4 Gimnazija Franje Petrića, Zadar, 5 Prva gimnazija Varaždin, Varaždin,
6
Gimnazija Dubrovnik, Dubrovnik.

iii
 Contents

Mathematical competitions in Croatia in 2015 iii

1 First round – City competition 1

2 Second round – County competition 4

3 Final round – National competition 7

3.1 Solutions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10

4 Croatian Mathematical Olympiad 22

4.1 Solutions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 24

In this booklet we present the problems from mathematical competitions for cat-
egory A in Croatia in 2015. The solutions are given for the problems of the Final
round and the Croatian 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.

iv
 1 First round – City competition

1.1. Determine positive integer n such that the sum of his two smallest divisors is 6
and the sum of his two largest divisors is 1122. (Function Space)

1.2. Let a and b be positive real numbers such that a3 + b3 = 2ab(a + b).
a2 b2
Determine + . (Ratko Višak)
b2 a2

1.3. The area of the intersection of a smaller and larger square equals two thirds of
the area of the smaller square, as well as one fifth of the area of their union.
Determine the ratio of the sides of the smaller and larger square.
(Andrea Aglić-Aljinović)

1.4. There are 100 circles in the plane, all having the same centre with radii 1, 2, . . . ,
100. The smallest circle is coloured in red and each of the 99 annuli bounded by
two circles is coloured in red or green, such that adjacent regions are of different
colour. Determine the total area of green regions.

1.5. Let I be the incentre of the acute triangle ABC and let |AC| > |BC|. The angle
bisector and the altitude from vertex C close an angle of 10◦ . If ^AIB = 120◦ ,
determine the angles of the triangle ABC. (Ilko Brnetić)

1.6. Does there exist a positive integer n such that n2 + 2n + 2015 is a perfect
square? (Ilko Brnetić)

1.7. Five teams are playing at a football tournament, each playing with the other
exactly once. Each victory is worth 3 points, defeat 0 points and a draw 1 point.
Is it possible that at the end of the tournament, in the final ranking, each team
except the last has exactly two points more than the next one? (Ilko Brnetić)

∗∗∗
Ä ä
2.1. Prove the following statement: if z is a complex number such that Re z−i
z+i = 0,
then |z| = 1. (Ilko Brnetić)

2.2. Let O be the circumcentre of the acute triangle ABC and let N be the foot of
the altitude from point A. Prove that ^BAN = ^CAO. (Hong Kong)

2.3. Determine the number of positive integers smaller than 1 000 000, that are also
perfect squares and yield a remainder 4 when divided by 8. (Ilko Brnetić)

1
2 First round – City competition

2.4. The sum of squares of all solutions of the equation x4 + ax2 + b = 0 is 32, and
the product of all solutions of that equation is 4. Determine a and b.
(Tamara Srnec)

2.5. Let ABCD be a quadrilateral such that |AB| = 6, |BC| = 9, |CD| = 18 and
|AD| = 5 hold. Determine the length of the diagonal AC if it is known that it
is a positive integer. (Andrea Aglić-Aljinović)

2.6. A field of the shape of a circular sector needs to be fenced using a wire of
length d. What is the maximal area of that field? (Ilko Brnetić)

2.7. Every team at a basketball tournament is playing with every other team exactly
twice. Each victory is worth 2 points, defeat 0 points and there are no draws.
Determine all positive integers n such that there exists a basketball tournament
with n teams with the overall winner having 26 points and exactly two teams
having the lowest number of points 20. (Ilko Brnetić)

∗∗∗

3.1. For any two positive real numbers x and y prove

log2 (xy) > log(x2 ) log(y 2 ). (Ilko Brnetić)

3.2. Determine all values that the expression

1 + cos2 x 1 + sin2 x
+ ,
sin2 x cos2 x
can attain, where x is a real number. (Tamara Srnec)

3.3. Determine the largest positive integer n such that

n + 5 | n4 + 1395. (Ilko Brnetić)

◦
3.4. Let ABCD √ be a tetrahedron such that ^BAC = ^CAD = ^DAB = 90 ,
|AD| = 2 2 and |AB| = |AC| = 3 holds. Determine the radius of the inscribed
sphere of the tetrahedron. (Mea Bombardelli)

3.5. Determine the least positive integer n such that in every set consisting of n
integers there are three pairwise distinct elements a, b and c such that ab+bc+ca
is divisible by 3. (Ilko Brnetić)

3.6. Let ABC be a triangle in which tan ^BAC = 1 and tan ^ABC = 2 holds.
Determine the ratio |BC| : |AB|. (Ilko Brnetić)
First round – City competition 3

3.7. There are ten white, and one red, blue, green, yellow and purple card. White
cards are identical. On exactly one side of each card is the sign X. In how many
ways is it possible to put the cards one on another such that no two cards face
each other with the side having the sign X? (Matija Bašić)

∗∗∗

4.1. Let a, b and c be real numbers and let f : R → R be a fuction given by

f (x) = ax5 + bx3 + c sin x − 1.

If f (−2015) = 2015, determine f (2015). (Stipe Vidak)

10
4.2. Determine the coefficient of x9 in the polynomial 1 + x3 + x6 .
(Ratko Višak)

n
X Sn + 1
4.3. Let n be a positive integer and let Sn = k!(k 2 + k + 1). Determine .
(n + 1)!
k=1
(Ratko Višak)

4.4. In a box, there is one red and five white balls marked by numbers 1, 2, 3, 4
and 5. Without looking, Domagoj draws one ball at a time until he draws
the red ball and then he stops. Drawn balls are not returned into the box.
What is the probability that the sum of the numbers on the drawn balls is at
least 10? (Ilko Brnetić)

4.5. If n is a positive integer, let Rn denote the integer that in the decimal repres-
entation consists of n digits 1. Prove the following statement: if Rn is a prime
number, then n is a prime number, too. (Mathematics Stack Exchange)

4.6. Let M and N be, respectively, the feet of the altitudes from vertices A and B of
the acute triangle ABC. Let Q be the midpoint of the segment M N and let P
be the midpoint of the segment AB. If |M N | = 10 and |AB| = 26, determine
the length of P Q. (Hong Kong)

4.7. Let n be a positive integer. Each of the numbers n, n + 1, n + 2, . . . , 2n − 1

has a largest odd divisor. Determine the sum of these largest odd divisors.
(Mathematics Stack Exchange)
 2 Second round – County competition

1.1. Let x and y be different real numbers such that 2xy + 1 6= 0, and let
6x2 y 2 + xy − 1 x(x2 − 1) − y(y 2 − 1)
A= and B = .
2xy + 1 x−y

Determine which number is larger, A or B. (Tonći Kokan)

1.2. Positive integers a, b and prime number p satisfy the equation a2 + p2 = b2 .

Prove that 2(b + p) is a perfect square. (Mathematics Stack Exchange)

1.3. Determine how many 6-digit positive integers are there such that by removing
its first two digits and its last two digits we get two 4-digit numbers, which give
the same remainder when divided by 99. (Mea Bombardelli)

1.4. Let AC be the diameter of the circle k1 with the centre B. Circle k2 touches
the line AC at the point B and the circle k1 at the point D. Tangent from A
(different from AC) to circle k2 touches that circle at the point E and intersects
the line BD in the point F . Determine the ratio |AF | : |AB|. (Hong Kong)

1.5. For a positive integer n, we say that an array with three rows and n columns is
magical if there exists a positive integer k, 1 6 k 6 n, such that
• the first row is filled with numbers . . . 1, 2, . . . , n in that order
• the second row is filled with numbers . . . k, k + 1, . . . , n, 1, 2, . . . , k − 1 in
that order
• the third row is filled with numbers between 1 and n in such order that
the sums of the three numbers in each column are all the same.
Determine all positive integers n for which a magical array exists, and for each
such n determine the number of magical arrays. (Ireland)

∗∗∗

2.1. Determine all pairs (a, b) of integers such that intersections of the parabola
y = x2 + ax + b and coordinate axes form vertices of a triangle whose area is
equal to 3. (Nikola Adžaga)

2.2. Determine all triples (a, b, c) of real numbers such that

1
a2 + b2 + c2 = 1 and (2b − 2a − c)a > . (Ivan Kokan)
2

4
Second round – County competition 5

2.3. Determine all quadruples (a, b, c, d) of positive integers such that

a3 = b2 , c 5 = d4 and a − c = 9. (China)

2.4. Let O be the circumcentre and H be the orthocentre of the triangle ABC.
Ray AO intersects the circumcircle of the triangle ABC in point D. Prove that
the line HD passes through the midpoint of the segment BC.

2.5. There are 4 easy and 8 difficult problems on a mathematical competition. There
are n students participating on this competition and each student has correctly
solved exactly 11 out of 12 problems.
For each pair of a difficult and easy problem, the number of students that have
correctly solved both problems was written. The sum of all 32 written numbers
is 256. Determine n. (Canada 2011)

∗∗∗

3.1. Let I be the incentre of the triangle ABC. If |AI| = |BC| and ^ACB =
2^BAC, determine the angles of the triangle ABC. (Brazil 2011)

3.2. Let bxc denote the largest integer not greater than real number x.
Determine all real solutions of the equation

11 bxc + x + 12 = 9x.
 

3.3. Let n be a positive integer larger than 1 such that both 2n − 1 and 3n − 2 are
perfect squares. Prove that 10n − 7 is composite. (Problem Solving Strategies)

3.4. Let ABCD be a convex quadrilateral such that ^BAD = 50◦ , ^ADB = 80◦
and ^ACB = 40◦ holds. If ^DBC = 30◦ + ^BDC, determine ^BDC.

3.5. Marko has 2n cards (n ∈ N), two cards with each of the numbers 1, 2, . . . , n.
Once we shuffled and put them one on top the other, he noticed that for every k
in {1, 2, . . . , n} between two cards with the number k there are exactly k other
cards. Prove that n2 + n is divisible by 4. (Counting and Configurations)

∗∗∗
√
4.1. Let a = 2015 2015 and (an ) be the sequence such that a1 = a and an+1 = aan
for n > 1. Does there exist a positive integer n such that an > 2015?

4.2. One side of a square lies on the line y = 2x−17, while the remaining two vertices
lie on the parabola y = x2 . Determine the area of that square. (China 2005)
6 Second round – County competition

4.3. Let n be a positive integer and a0 , a1 , . . . , a2n ∈ − π2 , π2 real numbers such that



tan ak = 2k−n for k = 0, 1, . . . , 2n.

Determine the sum a0 + a1 + · · · + a2n . (Matija Bašić)

4.4. A positive integer is called wacky if its decimal representation contains 100
digits, and if by removing any of those digits one gets a 99-digit number divisible
by 7. How many wacky positive integers are there? (Stipe Vidak)

4.5. A finite number of real numbers are ordered around a circle, and each number
is coloured red, white or blue. Each red number is twice smaller than the sum
of its two adjacent numbers, each white number is equal to the sum of its two
adjacent numbers, and each blue number is twice larger than the sum of its two
adjacent numbers. Let w be the sum of all white numbers, and b be the sum of
all blue numbers, where both w and b are not 0.
w
Determine the ratio b. (Ukraine 2013)
 3 Final round – National competition

1.1. Ten chairs are arranged around a round table and marked with numbers 1 to 10
successively (in such a way that chairs 1 and 10 are also adjacent), and a knight
is sitting in each chair. In the beginning, every knight has an even number of
coins. Simultaneously, each knight gives half of his coins to his left neighbour,
and the other half to his right neighbour. After that, the knight sitting in chair 1
has 22 coins, and each succeeding knight has two more coins, up until the knight
in chair 10 that has 40 coins.
How many coins did the knight that ended up with 36 coins have in the
beginning? (Hong Kong)

1.2. Prove that there does not exist a positive integer n such that 7n − 1 is divisible
by 6n − 1. (Ilko Brnetić)

1.3. Let a, b and c be positive real numbers such that a2 + b2 + c2 = 3. Prove that
a4 + 3ab3 b4 + 3bc3 c4 + 3ca3
+ + 6 4. (Tonći Kokan)
a3 + 2b3 b3 + 2c3 c3 + 2a3

1.4. The first n positive integers are written on a board (n > 3). Ante repeats the
following procedure: first he chooses two numbers on the board, and then he
increases them both by the same arbitrary number.
Determine all positive integers n such that Ante can, by repeating this proced-
ure, achieve that all numbers on the board are equal. (Ilko Brnetić)

1.5. Circes k1 and k2 intersect in points A and B. Line l intersects circle k1 in

points C and E, and circle k2 in points D and F in such a way that D is
between C and E, and E is between D and F . Lines CA and BF intersect in
point G, and lines DA and BE in point H.
Prove that CF k HG.

∗∗∗

2.1. Let a, b, c and d be four different real numbers. If a and b are solutions of
the equation x2 − 10cx − 11d = 0, and c and d are solutions of the equation
x2 − 10ax − 11b = 0, determine the sum a + b + c + d.
(Mathematics Stack Exchange)

2.2. Determine all triplets of positive integers (p, m, n) such that p is a prime number
and
pm − n3 = 8. (Greece)

7
8 Final round – National competition

2.3. Let ABC be an acute triangle with |AC| > |AB|. Let N be the foot of the
altitude from point A to side BC. Let P be a point on the extension of AB
over point B, and let Q be a point on the extension of AC over point C such
that BP QC is a cyclic quadrilateral.
If |N P | = |N Q|, show that N is the centre of the circle circumscribed to triangle
AP Q. (Japan)

2.4. Let a, b and c be positive real numbers such that a + b + c = 1. Prove that
a b c 1 1 1 1
Å ã
+ + 6 + + . (Tonći Kokan)
a + b2 b + c2 c + a2 4 a b c

2.5. A grasshopper is sitting in the origin of the number line, at number 0, and then
it jumps, always in the same direction. For a positive integer k, in the first
jump the grasshopper jumps to number 1, and every following jump is exactly
k times longer than the previous jump. There is a hole in place of all multiples
of number 2015.
Determine all positive integers k such that the grasshopper can jump 2015 times
without falling into a hole. (Ilko Brnetić)

∗∗∗

3.1. In a triangle ABC we have |BC| + |AC| = 2|AB| and ^BAC − ^CBA = 90◦ .
Determine the cosine of the angle ^ACB. (Hong Kong)

3.2. Determine all triples of positive integers (p, m, n) such that p is prime and

2m p2 + 1 = n5

holds. (Finland)

3.3. In a country between every two cities there is a direct bus or a direct train line
(all lines are two-way and they don’t pass through any other city). Prove that
all cities in that country can be arranged in two disjoint sets so that all cities
in one set can be visited using only train so that no city is visited twice, and
all cities in the other set can be visited using only bus so that no city is visited
twice.

3.4. On the side AC of the triangle ABC the points D and E are given such that D
is between C and E. Let F be the intersection of the circumcircle of the triangle
ABD and the line through the point E parallel to BC such that E and F are
on different sides of the line AB. Let G be the intersection of the circumcircle
of the triangle BCD and the line through E parallel to AB such that E and G
are on different sides of the line BC.
Prove that the points D, E, F and G lie on the same circle.
Final round – National competition 9

3.5. Let a, b and c be positive real numbers such that a + b + c > 1. Prove that
a − bc b − ca c − ab 3
+ + 6 . (Canada 2008)
a + bc b + ca c + ab 2

∗∗∗

4.1. Determine all functions f : R → R such that for all real numbers x and y

f (xy)(x + f (y)) = x2 f (y) + y 2 f (x)

holds. (Tonći Kokan)

4.2. Let ABC be a right triangle with the right angle at C. Let A0 , B 0 , C 0 be the
pedals of the perpendiculars from the centroid of the triangle ABC onto the
lines BC, CA, AB respectively.
Determine the ratio of the areas of the triangles A0 B 0 C 0 and ABC.

4.3. Determine all positive integers n for which there exists a divisor d of n such
that
dn + 1 | d2 + n2 .

4.4. Let n be a positive integer. Determine all positive real numbers x for which

22 32 (n + 1)2 n(n + 3)
+ + ··· + + nx2 = nx +
x+1 x+2 x+n 2
holds. (Tonći Kokan)

4.5. On the board 8 × 8 tromino-tiles of the shape have to be placed in such a

way that each tile covers exacty three cells of the board and the tiles cannot
overlap.
What is the least possible number of tromino-tiles that one can place on the
board so that no additional tromino-tile can be placed afterwards?
(Counting and Configurations)
10 Final round – National competition

3.1 Solutions

1.1. Denote by 2x1 , 2x2 , . . . , 2x10 the number of coins that the knights sitting in
chairs 1, 2, . . . , 10 had in the beginning, respectively. We have to determine 2x8 .
We have a system of equations x10 +x2 = 22, x1 +x3 = 24, x2 +x4 = 26, x3 +x5 = 28,
. . . , x8 + x10 = 38, x9 + x1 = 40.
By combining these equations we get

x10 = 38 − x8
x2 = 22 − x10 = 22 − (38 − x8 ) = x8 − 16
x4 = 26 − x2 = 26 − (x8 − 16) = 42 − x8
x6 = 30 − x4 = 30 − (42 − x8 ) = x8 − 12
x8 = 34 − x6 = 34 − (x8 − 12) = 46 − x8 .

From the last equality we have 2x8 = 46. The knight that ended up with 36 coins
had 46 coins in the beginning.

1.2. Assume that such n exists.

Note that 5 divides 6n − 1 = (6 − 1)(6n−1 + · · · + 1), so 5 also has to divide 7n − 1.
The powers of 7 when divided by 5 give remainders 2, 4, 3, 1, . . . and these remainders
repeat periodically. Therefore, 7n − 1 will be divisible by 5 if and only if n is divisible
by 4, i.e. n = 4k.
By the formula for the difference of kth powers, we can conclude that 64 − 1 divides
64k − 1. Moreover, 7 divides 64 − 1 = (62 − 1)(62 + 1) = 35 · 37 = 5 · 7 · 37. Therefore,
7 divides 6n − 1, so it also divides 7n − 1, which is a contradiction.

1.3. Note that

a4 + 3ab3 a(a3 + 2b3 ) + ab3 ab3
= = a + .
a3 + 2b3 a3 + 2b3 a3 + 2b3

By the inequality between arithmetic and geometric means we have

√
3
a3 + 2b3 = a3 + b3 + b3 > 3 a3 b3 b3 = 3ab2 .

We can conclude that

a4 + 3ab3 ab3 ab3 b
3 3
=a+ 3 3
6a+ =a+ .
a + 2b a + 2b 3ab2 3

Analogously, we have

b4 + 3bc3 c c4 + 3ca3 a
6b+ and 6c+ ,
b3 + 2c3 3 c3 + 2a3 3
Final round – National competition 11

so by adding the inequalities we have

a4 + 3ab3 b4 + 3bc3 c4 + 3ca3 4
3 3
+ 3 3
+ 3 6 (a + b + c).
a + 2b b + 2c c + 2a3 3
Finally, by using the inequality between arithmetic and quadratic means we have
…
a+b+c a2 + b2 + c2
4· 64· = 4.
3 3
This concludes the proof.

1.4. Assume n = 4k. Then Ante can achieve that all numbers on the board are
equal in the following way: he will increase by 1 the numbers 1 and 3, 5 and 7, . . . ,
4k − 3 and 4k − 1. By doing that, he gets that the numbers on the board are all even
numbers smaller than or equal to n, and each is written twice. Finally, he increases
2 and 2 by n − 2, 4 and 4 by n − 4, . . . , n − 2 and n − 2 by 2, and he gets that all
numbers on the board are equal to n.
Assume n = 2k +1. Then Ante can achieve that all numbers on the board are equal in
the following way: he will increase by 1 the numbers 1 and n, 3 and n, . . . , n−2 and n.
By doing that, he gets that the numbers on the board are all even numbers smaller
3n − 1
than or equal to n, each written twice, and the number . Finally, he increases
2
3n − 5 3n − 9 n+1
2 and 2 by , 4 and 4 by , . . . , n−1 and n−1 by . Now all numbers
2 2 2
3n − 1
on the board are equal to .
2
Assume n = 4k + 2. Then Ante cannot achieve that all numbers are equal. The sum
of all numbers on the board is initially odd, because
n(n + 1)
1 + 2 + ··· + n = = (2k + 1)(4k + 3).
2
Since there is an even number of numbers on te board, if they were equal their sum
would be an even number. On the other hand, in each step the sum of numbers on
the board is increased by an even number, so the sum will never be even.
Therefore, Ante can achieve that all numbers are equal if and only if n is not of the
form 4k + 2, k ∈ N.

1.5. It suffices to show that ^ECA = ^HGA.

Since the quadrilateral ACBE is cyclic, we have that ^ECA = ^EBA, so it suffices
to show that ABGH is a cyclic quadrilateral.
From triangle DEH we have ^DHE = 180◦ − ^EDH − ^HED, i.e.
^AHB = ^DHE = 180◦ − ^F DA − (180◦ − ^CEB),
so by using that ^CEB = ^CAB (which holds because ACBE is also cyclic) we
have that
^AHB = 180◦ − ^F DA − (180◦ − ^CAB) = 180◦ − ^F DA − ^GBA.
12 Final round – National competition

H
G
A
C

E
D
F
l

k2
k1 B

Quadrilateral ADBF is cyclic, so we have ^ADF = ^ABF = ^ABG. From that we

have

^AHB = 180◦ − ^F BA − ^BAG = 180◦ − ^GBA − ^BAG = ^AGB.

Therefore, ABGH is a cyclic quadrilateral, which finishes the proof.

∗∗∗

2.1. From Vièta’s formulas we have that a + b = 10c and c + d = 10a. By adding the
equations a + b = 10c and c + d = 10a we get that

a + b + c + d = 10(a + c).

Since a is the solution of the equation x2 − 10cx − 11d = 0, and d = 10a − c, it follows
that

0 = a2 − 10ac − 11d = a2 − 10ac − 11(10a − c) = a2 − 110a + 11c − 10ac.

Analogously we get that

c2 − 110c + 11a − 10ac = 0.

By subtracting these equations we have that

(a − c)(a + c − 121) = 0.

By dividing by a − c 6= 0 we get a + c = 121. Therefore, a + b + c + d = 1210.

2.2. By moving n3 , we get a sum of cubes on the right-hand side:

pm = n3 + 8 = (n + 2)(n2 − 2n + 4).
Final round – National competition 13

Since p is prime, each of the factors on the right-hand side must be a power of p:

n + 2 = pα
n2 − 2n + 4 = pβ .

Note that n2 −2n+4 > n+2, since that is equivalent to the claim that n2 −3n+2 > 0,
i.e. (n − 1)(n − 2) > 0, which holds because n is a positive integer. Therefore, β > α.
We can conclude that pα divides n + 2 and n2 − 2n + 4, so it also divides

n · (n + 2) − (n2 − 2n + 4) = 4n − 4,

and then it also divides 4 · (n + 2) − (4n − 4) = 12. Therefore, pα | 12, so p = 2 or

p = 3.
If p = 2, then n + 2 = pα is at most 4, and since n > 0, it follows that n + 2 = 4,
which gives the solution (2, 4, 2).
If p = 3, then n + 2 = pα is 3, so n + 2 = 3, which gives the second solution (3, 2, 1).

2.3. The sum of opposite angles in a cyclic quadrilateral is 180◦ , therefore ^CQP =
180◦ − ^P BC and ^QP B = 180◦ − ^BCQ, from which it follows that ^AQP =
^CBA and ^QP A = ^ACB.
Let O be the centre of the circle circumscribed to AP Q. Then ^AOP = 2^AQP .
Since the triangle AOP is isosceles, we have that ^P AO = 90◦ − ^AQP = 90◦ −
^ABC.

A A

B C B C
O N

Q Q

P P p

Let p be the line which closes an angle of 90◦ − ^ABC with line AP , and which
intersects the segment P Q. Since ^AN B = 90◦ , it follows that ^AN B = 90◦ −
^ABC, which implies that A, N and O all lie on p.
Since |AB| = 6 |AC|, it follows that ^AQP = ^ABC 6= ^ACB = ^AP Q, i.e. A
does not lie on the bisector of segment P Q. Therefore, the intersection of line p and
bisector of P Q is unique and it follows that N = O.
14 Final round – National competition

2.4. By using the condition a + b + c = 1 and the inequality between arithmetic and
geometric means, we have that
a a a a 1
= = 2 6 = .
a + b2 a(a + b + c) + b2 a + b2 + ab + ac 2ab + ab + ac 3b + c
By applying the inequality between harmonic and arithmetic means, it follows that
4 4 b+b+b+c 3b + c
3 1 = 1 1 1 1 6 = ,
b + c b + b + b + c
4 4

i.e.
a 1 1 3 1
Å ã
2
6 6 + .
a+b 3b + c 16 b c
Analogously,
b 1 3 1 c 1 3 1
Å ã Å ã
2
6 + and 2
6 + .
b+c 16 c a c+a 16 a b
Finally, by adding the inequalities above, we have that
a b c 1 4 4 4 1 1 1 1
Å ã Å ã
+ + 6 + + = + + .
a + b2 b + c2 c + a2 16 a b c 4 a b c

2.5. Let an be the number the grasshopper is located at after the n-th jump, i.e.

a1 = 1, an = 1 + k + · · · + k n−1 , n > 2.

We are looking for all numbers k such that 2015 - an for all n = 1, . . . , 2015.
Suppose that M (k, 2015) = d > 1. Then every an divided by d gives the remainder 1,
and since 2015 is divisible by d we have that 2015 - an for all n. Therefore, all
positive integers which are not relatively prime with 2015 comply with the terms of
the problem.
If M (k, 2015) = 1, we observe the remainders of dividing a1 , . . . , a2015 with 2015.
If one of them is divisible by 2015, such a k is not good. Otherwise, since there
are 2014 possible remainders, at least two numbers give the same remainder. Let
these numbers be al and am , m > l. In this case, their difference is divisible by 2015.
On the other hand, we have that

am − al = k l + · · · + k m−1 = k l (1 + · · · + k m−l−1 ) = k l · am−l .

From 2015 | k l · am−l and M (k, 2015) = 1, it follows that 2015 | am−l , which is in
contradiction with the assumption that none of the numbers a1 , . . . , a2015 is divisible
by 2015. Therefore, if M (k, 2015) = 1, the grasshopper will jump into a hole.
To conclude, the only numbers which are suitable for the terms of the problem are
those which are not relatively prime with 2015.

∗∗∗
Final round – National competition 15

3.1. Let D be the point on the side BC such that ^CAD = 90◦ . Let us denote
ϕ = ^CDA and x = |CD|. Then cos ^ACB = sin ϕ.

D
ϕ

A B

Then we have |AC| = x sin ϕ and |AD| = |DB| = x cos ϕ. We also have ^DAB = 21 ϕ
and |AB| = 2x cos ϕ cos 12 ϕ.
Since |BC| + |CA| = 2|AB|, we get
1
1 + cos ϕ + sin ϕ = 4 cos ϕ cos ϕ.
2

By squaring both sides of the equation we get

1
1 + cos2 ϕ + sin2 ϕ + 2 cos ϕ + 2 sin ϕ + 2 sin ϕ cos ϕ = 16 cos2 ϕ cos2 ϕ,
2
and further on

2(1 + cos ϕ)(1 + sin ϕ) = 8 cos2 ϕ(1 + cos ϕ),

1 + sin ϕ = 4(1 − sin2 ϕ),
(4 sin ϕ − 3)(sin ϕ + 1) = 0,
3
sin ϕ = ,
4
where we used cos ϕ 6= −1 and sin ϕ 6= −1, which is valid because the angle ϕ is acute.
Hence, cos ^ACB = 34 .

3.2. If we write down the given equation in the form 2m p2 = n5 − 1 and factorise the
right-hand side, we get

2m p2 = (n − 1)(n4 + n3 + n2 + n + 1).

Factor n4 + n3 + n2 + n + 1 is odd, so n − 1 is divisible by 2m .

We immediately see that p is odd.
On the other hand, since n is positive, we clearly have n4 + n3 + n2 + n + 1 > n − 1.
Hence p cannot divide n − 1, because otherwise n − 1 would be at least 2m p, and
n4 + n3 + n2 + n + 1 would be at most p, which is less than 2m p. Hence, we have

2m + 1 = n, p2 = n4 + n3 + n2 + n + 1.
16 Final round – National competition

Let us notice that the second equation is equivalent to the following equations:
n4 + n3 + n2 + n = p2 − 1,
n(n + 1)(n2 + 1) = (p − 1)(p + 1).

By plugging n = 2m + 1 into the last equation we get

(2m + 1)(22m + 2m+1 + 2)(2m + 2) = (p − 1)(p + 1),
which leads us to
4(2m + 1)(22m−1 + 2m + 1)(2m−1 + 1) = (p − 1)(p + 1).
Since p is odd, the right-hand side is the product of two consecutive even numbers,
so it is divisible by 8. The left-hand side is not divisible by 8, unless m = 1. Hence
the only solution is m = 1, n = 3, p = 11.

3.3. Let G be the set of all cities in the country. We call an ordered pair (A, Z),
where A and Z are disjoint subsets of G good if all cities in the set A can be visited
using only bus such that no city is visited twice and all cities in the set Z can be
visited using only train such that no city is visited twice.
Let (A, Z) be a good pair such that the set A∪Z has the maximal number of elements.
If we prove A ∪ Z = G, the statement of the problem holds.
Let us assume the opposite, i.e. there is a city g which isn’t from A nor Z. Without
loss of generality we can assume that A and Z are non-empty, because otherwise we
can transfer any city from a non-empty set to an empty one.
Let n be the number of cities in the set A, and m the number of cities in the set Z. Let
us arrange the cities from A in the series a1 , . . . , an such that every two consecutive
cities in that series are connected by a direct bus line. Also, let us arrange the cities
from Z in the series z1 , . . . , zm such that every two consecutive cities in that series
are connected by a direct train line.
Since we assumed that the pair (A, Z) is maximal, the cities g and a1 have to be
connected by train (otherwise the pair (A ∪ {g}, Z) would be a good pair whose union
would have more elements than A ∪ Z), and g and z1 have to be connected by bus
(otherwise the pair (A, Z ∪ {g}) would be a good pair whose union would have more
elements than A ∪ Z).
The cities a1 and z1 have to be connected by bus or by train.

z1 Z
...
zm

a1 A
...
an
Final round – National competition 17

If a1 and z1 are connected by bus, let us put A0 = {z1 , g, a1 , . . . , an } and Z 0 =

{z2 , . . . , zm }. Then (A0 , Z 0 ) is a good pair and the number of elements of A0 ∪ Z 0 is
greater than the number of elements of A ∪ Z, which contradicts the assumption.
If a1 and z1 are connected by train, let us put A00 = {a2 , . . . , an } and Z 00 = {a1 , g, z1 ,
z2 , . . . , zm }. Then (A00 , Z 00 ) is a good pair and the number of elements of A00 ∪ Z 00 is
greater than the number of elements of A ∪ Z, which contradicts the assumption.
Since all cases lead to contradiction, we conclude that the assumption was wrong and
that every city is either in the set A or in the set Z.

3.4. Let F 0 be the intersection of the line BG and the circumcircle of the triangle
ABD different from B.

F = F′

C D E A

The quadrilateral DAF 0 B is cyclic, so we have ^BF 0 D = ^BAD = ^BAC. Since

GE k AB, we have ^BAC = ^GEC. Hence ^GF 0 D = ^GEC, which means that
DEF 0 G is a cyclic quadrilateral.
Therefrom ^AEF 0 = ^DGF 0 = ^DGB. Since the quadrilateral CDBG is cyclic, we
have ^DGB = ^DCB, so we can conclude F 0 E k BC.
Hence, F 0 is the intersection point of the line parallel to BC through E and the
circumcircle of the triangle ADB, which means that F 0 = F . Hence DEF G is a
cyclic quadrilateral, which means that D, E, F and G lie on the same circle.

3.5. Let us first notice

a − bc a + bc − 2bc bc
= =1−2· ,
a + bc a + bc a + bc
b − ca ca c − ab ab
=1−2· , =1−2· .
b + ca b + ca c + ab c + ab

Now, from a + b + c > 1 it follows

bc bc bc
> = ,
a + bc a(a + b + c) + bc (a + b)(a + c)
18 Final round – National competition

and analogously
ca ca ab ab
> , > ,
b + ca (b + a)(b + c) c + ab (c + a)(c + b)
so we have
a − bc b − ca c − ab 2bc 2ca 2ab
+ + 63− − − .
a + bc b + ca c + ab (a + b)(a + c) (b + a)(b + c) (c + a)(c + b)
Hence, in order to prove the desired inequality, it is enough to prove
2bc 2ca 2ab 3
+ + > .
(a + b)(a + c) (b + a)(b + c) (c + a)(c + b) 2
Multiplying by (a + b)(b + c)(c + a) we see that the inequality above is equivalent to

4bc(b + c) + 4ca(c + a) + 4ab(a + b) > 3(a + b)(b + c)(c + a),

i.e.
a2 b + ab2 + b2 c + bc2 + c2 a + ca2 > 6abc.

The last inequality obviously holds since by the AM–GM inequality

√
6
a2 b + ab2 + b2 c + bc2 + c2 a + ca2 > 6 a6 b6 c6 = 6abc

holds.

∗∗∗

4.1. By plugging x = y = 0 into the given equation we get

f (0)2 = 0, i.e. f (0) = 0.

By plugging x = y = 1 into the given equation we get

f (1)(1 + f (1)) = 2f (1), i.e. f (1)2 = f (1).

We distinguish two cases: f (1) = 0 or f (1) = 1.

If f (1) = 0, by plugging x = 1 into the starting equation we get that for every y ∈ R

f (y)(1 + f (y)) = f (y), i.e. f (y) = 0.

If f (1) = 1, by plugging y = 1 into the starting equation we get that for every x ∈ R

f (x)(x + 1) = x2 + f (x), i.e. xf (x) = x2 .

For x 6= 0 dividing by x we get f (x) = x.

Since f (0) = 0, it follows that f (x) = x for every x ∈ R.
Now we easily check that the functions f (x) = 0 and f (x) = x really satisfy the
starting equation. Thus they are the only solutions.
Final round – National competition 19

4.2. Let us denote by T the centroid of the triangle ABC, by a, b, c lengths of the
sides BC, CA, AB respectively and by v the height to the side AB. Let us denote
α = ^CAB and β = ^ABC.
Since T is the centroid of the triangle ABC, we have
1 1 1 1 1
|T A0 | = |B 0 C| = |AC| = b, |T B 0 | = |A0 C| = |BC| = a, |T C 0 | = v.
3 3 3 3 3

C′

A′
T

C B′ A

We have

P (A0 B 0 C 0 )
= P (A0 B 0 T ) + P (B 0 C 0 T ) + P (C 0 A0 T )
1
= (|T A0 | · |T B 0 | + |T B 0 | · |T C 0 | · sin(180◦ − α) + |T C 0 | · |T A0 | · sin(180◦ − β))
2
1 1
= · (ab + av sin α + bv sin β).
2 9
Since v = a sin β, v = b sin α, a = c sin α, b = c sin β and c2 = a2 + b2 hold, we get:
1
P (A0 B 0 C 0 ) = (ab + a2 sin α sin β + b2 sin α sin β)
18
1 1
= (ab + c2 sin α sin β) = (ab + ab)
18 18
1 2
= · 2ab = P (ABC).
18 9
Hence, we get P (A0 B 0 C 0 ) : P (ABC) = 2 : 9.

4.3. Let us put n = ad. The condition dn + 1 | d2 + n2 can be written as ad2 + 1 |

d2 + a2 d2 .
Then ad2 + 1 divides d2 + a2 d2 − a · (ad2 + 1) = d2 − a as well.
Let us consider all possible signs of the number d2 − a.
If d2 − a > 0, then it must be d2 − a > ad2 + 1 (multiple is greater than or equal to
divisor). Since a is positive, we have d2 > ad2 + a + 1 > d2 , which is impossible.
20 Final round – National competition

If d2 − a < 0, then a − d2 > 0. Then it must be a − d2 > ad2 + 1. Since d is positive,

we have a > ad2 + 1 + d2 > a, which is also impossible.
Hence, the only possibility is d2 − a = 0, which gives a = d2 and n = d3 . In that case
d4 + 1 divides d2 + d6 = d2 (d4 + 1), so all possible numbers n are cubes of positive
integers.

n(n+3)
4.4. Since nx = x + x + · · · + x, and 2 = (1 + 2 + 3 + · · · + n) + n, the given
equation is equivalent to
n n n
X (k + 1)2 X X
+ nx2 − x− k − n = 0,
x+k
k=1 k=1 k=1

i.e.
n 
X (k + 1)2 
− (x + k) + nx2 − n = 0.
x+k
k=1

After some manipulation we get

(k + 1)2 (k + 1)2 − (x + k)2 k+1

Å ã
− (x + k) = = (1 − x) 1 + ,
x+k x+k x+k
so the given equation is equivalent to
n
 X k + 1
(1 − x) n + + n(x2 − 1) = 0,
x+k
k=1

i.e.
2 3 n+1
 Å ã 
(1 − x) n + + + ··· + − n(1 + x) = 0.
x+1 x+2 x+n

For x = 1 the equality is obviously satisfied. For x 6= 1 we have

2 3 n+1
Å ã
n+ + + ··· + = n(1 + x),
x+1 x+2 x+n
i.e.
2 3 n+1
+ + ··· + = nx.
x+1 x+2 x+n
If 0 < x < 1, then each of n fractions on the left-hand side is greater than 1, so the
left-hand side is greater than n, and the right-hand side is less than n.
If x > 1, exactly the opposite holds: the left-hand side is less than n, and the right-
hand side is greater than n. Hence, the only solution is x = 1.
Final round – National competition 21

4.5. Let us divide the board into 16 2 × 2 squares as in the picture.

In each of those squares at least two cells have to be covered, otherwise we could place
a triomino-tile on three uncovered cells. Hence, at least 32 cells have to be covered,
and we need at least 11 tromino-tiles to do that covering.
The next construction shows that 11 tromino-tiles are enough to satisfy conditions of
the problem.
 4 Croatian Mathematical Olympiad

Day 1

A1. Let m be a positive integer. We have 2m sheets of paper, with the number 1
written on each of them. We perform the following operation. In every step we
choose two distinct sheets; if the numbers on the two sheets are a and b, then
we erase these numbers and write the number a + b on both sheets. Prove that
after m2m−1 steps, the sum of the numbers on all the sheets is at least 4m .
(IMO shortlist 2014)

C1. A magical triangulation is a partition of a triangle on smaller triangles by a

finite number of segments whose endpoints are vertices of the triangle or points
in its interior, such that in every point (including the vertices of the triangle)
meets the same number of segments.
What is the maximal number of smaller triangles on which we can divide the
triangle in a magical triangulation? (Counting and Configurations)

G1. Circles k1 and k2 meet at points M and N . The line l meets the circle k1 in
points A and C, and the circle k2 in points B and D so that the points A, B,
C and D are on the line l in that order. Let X be a point on the line M N
such that the point M is between points X and N . Let P be the intersection
of lines AX and BM , and Q the intersection of lines DX and CM .
If K is the midpoint of the segment AD, and L the midpoint of the segment BC,
prove that the lines XK and M L meet on the line P Q. (Matija Bucić)
ú ü
2k
N1. For a positive integer k, let ak = . Prove that the sequence (ak ) contains
k
infinitely many odd numbers.
(bxc denotes the largest integer not greater than x.) (IMO shortlist 2014)

∗∗∗

Day 2

A2. For all positive real numbers x, y, z prove the following inequality
x2 y2 z2 (x + y + z)3
+ + > .
xy + z yz + x zx + y 3[x (y + 1) + y 2 (z + 1) + z 2 (x + 1)]
2

(Tonći Kokan)

22
Croatian Mathematical Olympiad 23

C2. Let N be a positive integer. In each square of a N × N array initially there is

a zero. In each move it is allowed to choose a row or a column, erase all the
numbers in it and then write numbers from 1 to N in arbitrary order. What is
the maximal possible value of the sum of all numbers in the array?
(Russia 2007)

G2. In an acute triangle ABC we have |AB| > |BC|, and the points A1 and C1
are the feet of altitudes from the vertices A and C, respectively. Let D be the
second intersection of the circumcircles of triangles ABC and A1 BC1 (different
from B). Let Z be the intersection of the tangents of the circumcircle of the
triangle ABC at points A and C, and let lines ZA and A1 C1 meet at the
point X, and lines ZC and A1 C1 at the point Y .
Prove that the point D lies on the circumcircle of the triangle XY Z.
(Romania 2014)

N2. Let n > 2 be a positive integer and p a prime number. If the number p − 1 is
divisible by n, and the number n3 − 1 is divisible by p, prove that 4p − 3 is a
square of an integer.

∗∗∗

Final test for MEMO team selection

A3. Determine all functions f : R → R such that

f (xf (x) + f (xy)) = f (x2 ) + yf (x)

holds for all real numbers x and y. (Tonći Kokan)

C3. Let n > 3 be a natural number. Some diagonals are drawn in a convex n-gon.
We say that a drawn diagonal is good if it intersects another drawn diagonal in
its interior. Determine the maximal possible number of good diagonals.
(Russia 2014)

G3. Let I be the incentre of the triangle ABC and let D be the point on side AC such
that |AB| = |DB|. Incircle of the triangle BCD touches the lines AC and BD
in points E and F , respectively. Prove that the line EF passes through the
midpoint of the segment DI.

N3. Determine all positive integers x and y such that

x(x2 + 19) = y(y 2 − 10). (Tonći Kokan)

∗∗∗
24 Croatian Mathematical Olympiad

Final test for IMO team selection

A4. Determine all functions f : R → R such that

f (f (x))(x − f (y)) + 2xy = f (x)f (x + y)

holds for all real numbers x and y. (Tonći Kokan)

C4. In a country there are N cities and among some of them there are (two-way)
flight connections. Each flight connects exactly two cities. No city is not directly
connected to every other city. For any two cities A and B there is exactly one
way to fly from A to B using at most two flights.
Prove that N − 1 is a square of a positive integer. (Belarus 2014)

G4. In a quadrilateral ABCD we have ^DAB = 110◦ , ^ABC = 50◦ , ^BCD = 70◦ .
Let M and N be midpoints of segments AB and CD respectively. Let P be
a point on the segement M N such that |AM | : |CN | = |M P | : |N P | and
|AP | = |CP |. Determine ^AP C. (Japan)

N4. Prove that for every positive integer n there exist integers a and b such that n
divides 4a2 + 9b2 − 1. (Math prize for girls olympiad 2010)

4.1 Solutions

Day 1

A1. Let Pk denote the product of all numbers on the papers after k steps. In each
step we take two papers with numbers a and b and replace them by papers with a + b
and a + b, so for the products after k steps and after k + 1 steps we have
Pk
Pk+1 = · (a + b)2 .
ab
It follows that
Pk+1 (a + b)2
= > 4.
Pk ab
m−1
Since P0 = 1, we have Pk > 4k and in particular Pm2m−1 > 4m2 . By the AM–GM
inequality applied to the 2m numbers written on the papers after m2m−1 steps we
have m−1
1
m
p m
Sm2m−1 > 2m · 2 Pm2m−1 > 2m · 4m2 2m
= 2m · 4 2 = 4m .

C1. Let n be the number of smaller triangles, t the number of points in the trian-
gulation (including the vertices of the triangle), d the number of segments (including
the sides of the triangle) and k the number of segments meeting in each point of the
triangulation.
Croatian Mathematical Olympiad 25

Obviously t · k = 2 · d holds. Furthermore, d segments are sides of n + 1 triangles, so

2d = 3(n + 1) since each segment is a side of exactly two triangles.
Finally, let us consider the sum of inner angles of smaller triangles. That sum is
equal to n · 180◦ . On the other hand, in each of t − 3 points in the interior of the
triangle that sum is equal to 360◦ , so when we add the angles of the big triangle we
get that the sum of angles of the smaller triangles is equal 180◦ + (t − 3) · 360◦ . Hence
n · 180◦ = 180◦ + (t − 3) · 360◦ , i.e. 2t = n + 5. From these equations, it follows that

5k − 6 24
n= = + 5.
6−k 6−k

So, 6 − k divides 24 and te only possibilities for a positive integer n are obtained if
k ∈ {2, 3, 4, 5}, i.e. n ∈ {1, 3, 7, 19}. The maximal possible number of smaller triangles
is 19 and the following example shows that this can be achieved.

G1. Let Y be the second intersection of the circle k1 with the line AX and let Z be
the second intersection of the circle k2 with the line DX.
Since lines AY , DZ and M N pass through the point X, by the converse of the radical
centre theorem„ quadrilateral AY ZD is cyclic. Hence ^Y ZX = ^XAD.
Since AY M C is a cyclic quadrilateral, it holds ^Y M Q = ^Y AC = ^XAD, so
^Y M Q = ^Y ZX = ^Y ZQ and it follows that the quadrilateral QY M Z is cyclic.
Analogously, quadrilateral P Y M Z s cyclic, so points P , Q, Z, Y , M lie on the same
circle. From this it follows that ^QP Y = ^QZY = ^XAD, so P Q k AD.
Hence the quadrilaterals ADP Q and BCP Q are trapeziums, and since the midpoints
of bases of a trapezium and the intersection of its diagonals lie on the same line, we
conclude the lines KX and LM pass trough the midpoint of the segment P Q. This
finishes the proof.
26 Croatian Mathematical Olympiad

k1
k2

D
C l
K L
B
A

M Z
Y

N1. Let k = 3 · 4l . Then

l l l
2k 23·4 23·4 −2l 23·4 −2l − 1 1
= = = + .
k 3 · 4l 3 3 3
l
23·4 −2l − 1
The fraction is an integer beacuse 22m = 4m ≡ 1 (mod 3).
3
∗∗∗

Day 2

A2. By the CSB inequality we have

x2 y2 z2
Å ã
+ + [x(xy + z) + y(yz + x) + z(zx + y)]
xy + z yz + x zx + y
√ √ √
> (x x + y y + z z)2 . (1)
By the inequality between means we have
Ç √ √ √ å2
x x+y y+z z 3 x+y+z
> ,
3 3
i.e.
√ √ √ (x + y + z)3
(x x + y y + z z)2 > . (2)
3
Croatian Mathematical Olympiad 27

By the AM–GM inequality we have

x2 + y 2 + z 2 > xy + yz + zx. (3)

So from (1), (2) and (3) it follows that

√ √ √
x2 y2 z2 (x x + y y + z z)2
+ + > 2
xy + z yz + x zx + y x y + y 2 z + z 2 x + zx + xy + yz
√ √ √
(x x + y y + z z)2
> 2
x y + y 2 z + z 2 x + x2 + y 2 + z 2
(x + y + z)3
> .
3[x2 (y + 1) + y 2 (z + 1) + z 2 (x + 1)]

C2. Let us first prove the following statement:

Let k a positive integer. In an array with dimensions m × n (m, n > k) all squares
are initially white. In each move it is allowed to choose a row or a column and colour
the squares in it so that there is at most k black squares (other squares are white).
After each move there will be at least (m − k) · (n − k) white squares in the array.
We will prove the above statement by induction on the number of squares in an
array. For m = k or n = k the statement obviously holds. Let us assume that
m, n > k and that the statement holds for all arrays of dimensions smaller than
m × n. Without loss of generality we may assume that in the last move we have
performed the transformation on some row. In that row there must me at least n − k
white squares. If we disregard that row we may assume that all previous moves were
made on an array of dimensions (m − 1) × n. By the inductive hypothesis the smaller
array has at least (m − 1 − k) · (n − k) white square, and this implies that the array
with dimensions m × n has at least (n − k) + (m − 1 − k)(n − k) = (m − k)(n − k)
white squares. This proves the statement.
Let m = n = N and let us assume that after some number of moves number i appears
Ai times in the array (1 6 i 6 N ). If we consider the squares in which there is number
N to be black, and all other squares to be white, then the above statement implies
AN 6 N 2 − (N − 1)2 .
More generally, if we consider the squares in which numbers S + 1, . . . , N + 1, N
(S = N − 1, N − 2, . . . , 0) to be black, and all other squares to be white, then the
above statement (with k = N − S) implies
AS+1 + · · · + AN 6 N 2 − S 2 .
If we sum all inequalities for S = N − 1, N − 2, . . . , 0 we get
N · AN + (N − 1)AN −1 + (N − 2)AN −2 + · · · + 2A2 + A1

6 N · N 2 − ((N − 1)2 + (N − 2)2 + · · · + 02 )

(N − 1)N (2N − 1) 4N 3 + 3N 2 − N
= N3 − = .
6 6
28 Croatian Mathematical Olympiad

On the other hand, we can achieve the equality in the following way. We apply the
transformation by alternating between rows and columns, filling the rows from top
to bottom and the columns from left to right. We write the numbers in each row in
a descending order from left to right and in each column from top to bottom. After
these transformations in the first row and the first column there will be number N ,
in the squares of the second row and the second column which are not in the first
row/column there will be number N − 1 and so on.

G2. Let α = ^BAC, β = ^CBA and γ = ^ACB.

Since ^CAZ = ^ZCA = β (angle between the tangent and the chord), it follows
that ^XZY = ^AZC = 180◦ − 2β.
Quadrilateral CAC1 A1 is cyclic, so ^C1 A1 B = ^Y A1 C = α, ^BC1 A1 = ^AC1 X =
γ. Since ^XAC1 = 180◦ − ^CAZ − ^BAC = 180◦ − β − α = γ, from the triangle
AXC1 we have ^C1 XA = 180◦ − 2γ. Analogously, from the triangle A1 Y C we have
^CY A1 = 180◦ − 2α.
Let us show that the quadrilateral A1 AXD is cyclic. Since quadrilaterals A1 C1 BD
and CABD are cyclic, we have ^C1 DB = ^C1 A1 B = α and ^ADB = ^ACB = γ,
so ^ADC1 = ^ADB − ^C1 DB = γ − α. Furthermore, ^A1 DC1 = ^A1 BC1 = β, so
^A1 DA = ^A1 DC1 − ^ADC1 = β − (γ − α) = α + β − γ = 180◦ − 2γ = ^A1 XA,
and the quadrilateral A1 AXD is cyclic.

B
D

X
C1

A1

C A

Z
Croatian Mathematical Olympiad 29

Similarly, ^CDC1 = ^CDA + ^ADC1 = β + (γ − α) = 180◦ − 2α = ^CY C1 , so the

quadrilateral CC1 DY is cyclic.
Now we have

^Y DX = ^Y DC + ^CDA + ^ADX
= ^Y C1 C + ^CBA + ^AA1 X
= ^A1 C1 C + ^CBA + ^AA1 C1
= (90◦ − γ) + β + (90◦ − α) = 2β,

so ^XZY + ^Y DX = 180◦ , from what we conclude that the quadrilateral XDY Z is

cyclic.

N2. Since n divides p − 1, there is a positive integer a such that p − 1 = an. Also we
have p − 1 > n.
From the condition that n3 −1 = (n−1)(n2 +n+1) is divisible by the prime number p,
it follows that n2 + n + 1 is divisible by p. Indeed, 1 < n − 1 < p, so n − 1 cannot be
divisible by p.
Hence an + 1 = p | n2 + n + 1. This implies that 1 6 a 6 n + 1 (because if a > n + 2,
then an + 1 > (n + 2) · n + 1 = n2 + 2n + 1 > n2 + n + 1, which is impossible).
Also, from the same divisibility it follows that an + 1 | a · (n2 + n + 1) − n · (an + 1) =
(a − 1)n + a, which is positive, so we must have (a − 1)n + a > an + 1, i.e. a > n + 1.
It follows that a = n + 1 and p = n2 + n + 1.
Hence 4p − 3 = 4n2 + 4n + 1 = (2n + 1)2 .

∗∗∗

Final test for MEMO team selection

A3. If we plug x = 0 in the equation, we get f (f (0)) = f (0) + yf (0) for all y ∈ R.
This implies f (0) = 0.
Let f (1) = c and plug in x = 1, it follows that f (c + f (y)) = c(1 + y) for all y ∈ R.
If c = 0, then f (f (y)) = 0 for all y ∈ R. By appplying f to the given equation, it
follows that 0 = f (f (x2 ) + yf (x)). Assume that f (t) 6= 0 for some t ∈ R. Then we
can find y ∈ R such that t = f (t2 ) + yf (t) and we get 0 = f (f (t2 ) + yf (t)) = f (t) 6= 0,
which is a contradiction. Hence, in this case f (x) = 0 for all x ∈ R.
If c 6= 0, then it follows that f is injective. If we plug in y = 0, we get f (xf (x)) =
f (x2 ), i.e. f (x) = x for all x 6= 0. As we know f (0) = 0, we conclude that f (x) = x
is another solution.
It is easy to check that f (x) = 0 for all x ∈ R and f (x) = x for all x ∈ R are indeed
solutions.
30 Croatian Mathematical Olympiad

C3. Let M (n) be the maximal possible number of good diagonals in a convex n-gon.
We will show that M (n) = n − 2 if n is even and M (n) = n − 3 if n is odd. For any n,
we can draw all n − 3 diagonals from one vertex A and one more diagonal connecting
two vertices adjacent to A. We show by mathematical induction that M (n) > n − 2
if n is even. For n = 4 the claim is true as both diagonals in a convex quadrilateral
are good. Let us assume that the claim is true for n − 2 and consider a convex n-gon
A1 A2 . . . An . We draw diagonals An−2 An , A1 An−1 and we use the assumption on
A1 A2 . . . An−2 , so M (n) > M (n − 2) + 2 > n − 4 + 2 = n − 2.
We also prove by induction that M (n) 6 n − 2 if n is even and that M (n) 6 n − 3
if n is odd. Obviously, M (3) = 0 and M (4) = 2. Let us assume that the claim holds
for all n smaller than k.
Let us consider a choice of diagonals of a convex k-gon for which M (k) is achieved.
First case: if there are two good diagonals that intersect, they divide the k-gon into 4
part, each having ai > 0 vertices, not counting the endpoints of these diagonals (for
1 6 i 6 4). Since there is no other segment that intersects these two diagonals, we
have
4
X 4
X
M (k) = 2 + M (ai + 2) 6 2 + (ai + 2 − 2) = 2 + (k − 4) = k − 2.
i=1 i=1

If k is odd, then at least one of the numbers ai must also be odd, so we get the bound
k − 3 in this case.
Second case: if there are no two good diagonals that intersect, then there is automat-
ically at most k − 3 good diagonals as that is the maximal number of diagonals that
we can draw from one vertex.

G3. We denote by a, b and c the lengths of the sides BC, CA and AB respectively.

I J

C E D K N A

Let K be the point at which the incircle of the triangle ABC touches the line AC.
Let N be the foot of the altitude from B in triangle ABC and let J be the intersection
of line EF and the altitude BN .
Croatian Mathematical Olympiad 31

Note that ^JN E = ^AKI = 90◦ and

1 ^ADB ^BAC
^N EJ = (180◦ − ^F DE) = = = ^IAK.
2 2 2

c+d−a
Let d = |CD|. Then |ED| = and
2

c+d−a b−d b+c−a

|EN | = |ED| + |DN | = + = = |AK|.
2 2 2

Hence the triangles AIK and EJN are congruent. It follows that |IK| = |JN |, so
|IJ| = |KN |. Furthermore,

b+c−a b−d c+d−a

|IJ| = |KN | = |AK| − |AN | = − = = |ED|.
2 2 2

From this we conclude that EDJI is a parallelogram and hence its diagonals have
the same midpoint.

N3. Let d be the greatest common divisor of x and y, and let us denote x = da and
y = db, where a and b are relatively prime integers. Then the equation becomes

a(d2 a2 + 19) = b(d2 b2 − 10),

what can be rewritten as

19a + 10b = d2 (b3 − a3 ).

As b − a divides the right-hand side, it must also divide 19a + 10b = 10(b − a) + 29a.
This implies that b − a divides 29a. As a and b are relatively prime, so are b − a and a.
We conclude that b − a divides 29, so b − a = 1 or b − a = 29.
If b − a = 29, the equation becomes 10 + a = d2 (3a2 + 87a + 841), which has no
solution since the left-hand side is obviously smaller than the right-hand side.
If b − a = 1, the equation becomes

10 + 29a = d2 (3a2 + 3a + 1).

If d > 3, then the left-hand side is smaller than the right-hand side. If d = 2, then
we get the quadratic equation 12a2 − 17a − 6 = 0, which has no integral solution.
If d = 1, we get 3a2 − 26a − 9 = 0, which has one integral solution a = 9. Hence, the
only solution of the given equation is x = 9 and y = 10.

∗∗∗
32 Croatian Mathematical Olympiad

Final test for IMO team selection

A4. Let us denote a = f (0). If we put x = y = 0 in the given equation, we get:

f (a)(−a) = a2 , (4)

which implies that a = 0 or a = −f (a).

If we put x = a, y = 0 in the given equation, we get f 2 (a) = 0, which, in combination
with (4), gives a = 0, i.e. f (0) = 0.
Putting y = 0 in the given equation gives us:

xf (f (x)) = f 2 (x). (5)

Let us denote b = f (1). Putting x = 1 into (5) gives us:

f (b) = b2 . (6)

Putting x = 1, y = b into the given equation and using (6) gives us:

b2 (1 − b2 ) + 2b = bf (b + 1). (7)

Similarly, putting x = b, y = 1 into the given equation and also using (6) gives us:

2b = b2 f (b + 1). (8)

If b = 0, putting x = 1 into the given equation gives us 2y = 0, which is clearly not

possible for all y ∈ R. Thus b 6= 0 and (8) gives us:

bf (b + 1) = 2. (9)

If we combine (7) and (9) we get:

b2 (1 − b2 ) + 2b = 2,

which can be written as:

(b − 1)2 (b2 + 2b + 2) = 0.
The only real number that satisfies this equation is b = 1. Therefore, f (1) = 1.
Putting x = 1, y = x into the given equation gives us

f (x + 1) + f (x) = 2x + 1. (10)

By putting y = 1 into the given equation and using (5), we get

f 2 (x)(x − 1) + 2x2 = xf (x)f (x + 1). (11)

For a given x, let t = f (x). Combining (10) and (11) we get

t2 (x − 1) + 2x2 = xt(2x + 1 − t),

Croatian Mathematical Olympiad 33

which can be written as

(t − x)(2tx − 2x − t) = 0.
Thus, for every x ∈ R it holds
2x
f (x) = x or f (x) = . (12)
2x − 1

Let S = {x ∈ R | f (x) 6= x}. From (10) we conclude that x ∈ S =⇒ x + 1 ∈ S.

Therefore, S is either empty or infinite. Let us assume that S =
6 ∅. If we take an
arbitrary x ∈ S we have
2x 2x + 2
f (x) = and f (x + 1) = . (13)
2x − 1 2x + 1
Combining (10) and (13) we get

2x 2x + 2
+ = 2x + 1,
2x − 1 2x + 1
which can be written as
8x3 − 4x2 − 6x + 1 = 0.
This equation has at most three distinct solutions which contradicts the assumption
that S is an infinite set. Therefore, S is an empty set and f (x) = x, for all x ∈ R.
An easy check verifies that this is indeed a solution.

C4. Let a be an arbitrary city and let it be connected to cities x1 , . . . , xk . We denote

by Bi the set of all cities connected to xi that are different from a, for i = 1, . . . , k.
Sets B1 , . . . , Bk are pairwise disjoint because there is exactly one way to fly from xi
to xj in at most two flights.
If we consider two indices i and j and an arbitrary city y ∈ Bi , there exists a unique
city z ∈ Bj such that y and z are connected (because there must be a way to come
from y to xj in at most two flights and there is no direct flight).
We conclude that every element of some set Bi has exactly k connections and that
all sets Bi have the same number of elements. Let m be the number of elements of
the sets Bi . Then N = 1 + k + km.
Furthermore, let us consider some city b ∈ B1 . It is connected to x1 and also to exactly
one city ci ∈ Bi for i = 2, . . . , k. Note that xi is connected to ci for i = 2, . . . , k. By
the same way as above (with b instead of a) we conclude that cities xi (for i = 2, . . . , k)
have k connections. But we already know that cities xi have m + 1 connections (one
to the city a and m to cities in Bi ). Hence k = m + 1 and N − 1 = k + km = k 2 .

G4. Let K be the intersection of lines AD and BC. Since ABCD is a cyclic quadri-
lateral, triangles DKC and BKA are similar. As N and M are midpoints of respective
segments, we have ^CKN = ^M KA . It follows that triangles CKN and AKM are
similar, too.
34 Croatian Mathematical Olympiad

A′ N

D P

A M B

Hence |KM | : |KN | = |AM | : |CN |. By the condition in the problem, we have
|KM | : |KN | = |M P | : |N P |. We conclude that KP is the angle bisector of the
angle ^N KM , which implies that KP is the angle bisector of the angle ^AKC.
Using |AP | = |CP | we will prove that the quadrilateral AP CK is cyclic. Indeed, let
point A0 6= A be on the line KA such that |A0 P | = |AP | = |CP |. Then the triangles
KA0 P and KCP are congruent and A0 P CK is a deltoid. Since the triangle A0 AP
is isosceles, we have ^P AA0 = ^AA0 P = 180◦ − ^P A0 K = 180◦ − ^KCP . Hence,
AP CK is a cyclic quadrilateral.
Since ^AKC = 20◦ , it follows that ^AP C = 160◦ .

N4. If n is odd, let n = 2k + 1 for some non-negative integer k. For a = k and b = 0

we have 4a2 + 9b2 − 1 = (2k + 1)(2k − 1), so n divides 4a2 + 9b2 − 1.
If n is not divisible by 3, let n = 3k+r for some non-negative integer k and r ∈ {1, −1}.
For a = 0 and b = k we have 4a2 +9b2 −1 = (3k +1)(3k −1), so n divides 4a2 +9b2 −1.
If n is divisible by 6, we write n = 2r 3s m for some positive integers r, s and m such
that m is relatively prime to 6. Since 2r and 3s m are relatively prime, there are
integers k and l such that 2r k + 3s ml = 1. Squaring this equation we get
22r k 2 + 32s m2 l2 + 2 · 2r 3s mkl = 1,
i.e. 2nkl = 22r k 2 + 32s m2 l2 − 1. If we define a = 2r−1 k and b = 3s−1 ml, we conclude
that n divides 4a2 + 9b2 − 1.