ROMANIAN MATHEMATICAL COMPETITIONS

2016

Edited by MARIEAN ANDRONACHE, MIHAIL BĂLUNĂ, RADU GOLOGAN

ANDREI ECKSTEIN, MARIUS PERIANU, CĂLIN POPESCU, DINU ŞERBĂNESCU
with the cooperation of Dan Schwarz

Technical Editor A LEXANDRU N EGRESCU

TABLE OF CONTENTS

Foreword . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . v
1.1. 2016 Romanian Mathematical Olympiad – District Round . . . . . . . . . . . . . . . . . . . . . .1
1.2. 2016 Romanian Mathematical Olympiad – Final Round . . . . . . . . . . . . . . . . . . . . . . .13
1.3. Shortlisted problems for the 2016 Romanian NMO . . . . . . . . . . . . . . . . . . . . . . . . . . . 33
1.4. Selection tests for the 2016 BMO and IMO . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37
1.5. Selection tests for the 2016 JBMO . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 59
1.6. 2013 – 2014 Local Mathematical Competitions

1.6.1. The 2013 DANUBE Mathematical Competition . . . . . . . . . . . . . . . . . . . . . . . . 77

1.6.2. The 2013 Tenth IMAR1 Mathematical Competition . . . . . . . . . . . . . . . . . . . 81
1.6.3. The 2013 Sixth S TARS OF M ATHEMATICS Competition . . . . . . . . . . . . . . . . 87
1.6.4. The 2016 Sixth ROMANIAN M ASTER OF M ATHEMATICS . . . . . . . . . . . . . 103

1 I NSTITUTE OF M ATHEMATICS OF THE ROMANIAN ACADEMY. One-day IMO-type contest.

iii
iv
FOREWORD

The 21th volume of the ”Romanian Mathematical Contests” series contains more
than 200 problems, submitted at different stages of the Romanian Mathematical Olym-
piad, other Romanian Contests, and some international ones. Most of them are origi-
nal, but some problems from other sources were used as well during competition.

The most part of the problems are discussed in detail, and alternative solutions or
generalizations are given. Some of the solutions belong to students and were given
while they sat the contest; we thank them all.

We thank the Ministry of National Education for constant involvement in support-

ing the Olympiads and the participation of our teams in international events.

Special thanks are due to companies who were involved in sponsoring the Roma-
nian Olympiad and the partitipation of the Romanian Teams to International Compe-
titions: Emag Foundation and Ţuca Zbârcea and Associates.

Radu Gologan
President of the Romanian Mathematical Society

v
vi
THE 65th ROMANIAN MATHEMATICAL OLYMPIAD
DISTRICT ROUND

7th GRADE

Problem 1.

Solution.

Problem 2.

Solution.

Problem 3.

Solution.

Problem 4.

Solution.

8th GRADE

Problem 1.

Solution.

Problem 2.

1
2 2016 ROMANIAN M ATHEMATICAL O LYMPIAD – D ISTRICT ROUND

Solution.

Problem 3.

Solution.

Problem 4.

Solution.

9th GRADE

Problem 1.

Solution.

Problem 2.

Solution.

Problem 3.

Solution.

Problem 4.

Solution.
2016 ROMANIAN M ATHEMATICAL O LYMPIAD – D ISTRICT ROUND 3

10th GRADE

Problem 1.

Solution.
Problem 2.

Solution.
Problem 3.

Solution.
Problem 4.

Solution.

11th GRADE

Problem 1.

Solution.
Problem 2.

Solution.
Problem 3.

Solution.
Problem 4.

Solution.
4 2016 ROMANIAN M ATHEMATICAL O LYMPIAD – D ISTRICT ROUND

12th GRADE

Problem 1.

Solution.

Problem 2.

Solution.

Problem 3.

Solution.

Problem 4.

Solution.
THE 65th ROMANIAN MATHEMATICAL OLYMPIAD
FINAL ROUND

7th GRADE

Problem 1.

Solution.

Problem 2.

Solution.

Problem 3.

Solution.

Problem 4.

Solution.

8th GRADE

Problem 1.

Solution.

5
6 2016 ROMANIAN M ATHEMATICAL O LYMPIAD – F INAL ROUND

Problem 2.

Solution.

Problem 3.

Solution.

Problem 4.

Solution.

9th GRADE

Problem 1.

Solution.

Problem 2.

Solution.

Problem 3.

Solution.

Problem 4.

Solution.
2016 ROMANIAN M ATHEMATICAL O LYMPIAD – F INAL ROUND 7

10th GRADE

Problem 1.

Solution.
Problem 2.

Solution.
Problem 3.

Solution.
Problem 4.

Solution.

11th GRADE

Problem 1.

Solution.
Problem 2.

Solution.
Problem 3.

Solution.
Problem 4.

Solution.
8 2016 ROMANIAN M ATHEMATICAL O LYMPIAD – F INAL ROUND

12th GRADE

Problem 1.

Solution.

Problem 2.

Solution.

Problem 3.

Solution.

Problem 4.

Solution.
SHORTLISTED PROBLEMS FOR THE 65th NMO

JUNIORS

1.

SENIORS

1.

PUTNAM SENIORS

1.

CONTRIBUTORS
????????????????????????????????????? Aurel Bârsan, Nicolae Bourbăcuţ, Petru
Braica, Gheorghe Bumbăcea, Alexandru Buna-Mărginean, Lucian Dragomir, Bog-
dan Enescu, Marin Ionescu, Gheorghe Iurea, Cristinel Mortici, Nicolae Muşuroia,
Ion Nedelcu, Radu Pop, Vasile Pop, Claudiu Ştefan Popa, Florin Stănescu, Traian
Tămâian.

9
10 S HORTLISTED PROBLEMS FOR THE 2016 ROMANIAN NMO
THE 65th NMO SELECTION TESTS FOR THE BALKAN
AND INTERNATIONAL MATHEMATICAL OLYMPIADS

FIRST SELECTION TEST

Problem 1.

Solution.

Problem 2.

Solution.

Problem 3.

Solution.

Problem 4.

Solution.

SECOND SELECTION TEST

Problem 5.

11
12 S ELECTION TESTS FOR THE 2016 BMO AND IMO

Solution.

Problem 6.

Solution.

Problem 7.

Solution.

Problem 8.

Solution.

THIRD SELECTION TEST

Problem 9.

Solution.

Problem 10.

Solution.

Problem 11.

Solution.

Problem 12.

Solution.
S ELECTION TESTS FOR THE 2016 BMO AND IMO 13

FOURTH SELECTION TEST

Problem 13.

Solution.
Problem 14.

Solution.
Problem 15.

Solution.
Problem 16.

Solution.

FIFTH SELECTION TEST

Problem 17.

Solution.
Problem 18.

Solution.
Problem 19.

Solution.
Problem 20.

Solution.
14 S ELECTION TESTS FOR THE 2016 BMO AND IMO
THE 65th NMO SELECTION TESTS FOR THE JUNIOR
BALKAN MATHEMATICAL OLYMPIAD

FIRST SELECTION TEST

Problem 1. Let ABC be a non-equilateral triangle such that m(∠A) = 60◦ . Let
D and E be the intersection points of the Euler line of triangle ABC and the sides of
the angle ∠BAC. Prove that the triangle ADE is equilateral.

∗ ∗ ∗

Solution. et H and O be the orthocenter and the circumcenter of ABC, R the

radius of the circumcenter; then OH meets the line AB at D and the line AC at E.
Let B 0 be the foot of the altitude from B and C 0 be the foot of the altitude from C.
Since BCC 0 B 0 is a cyclic quadrilateral we have ∠AB 0 C 0 ≡ ∠ABC. Hence
0
∆ AB 0 C 0 ∼ ∆ ABC, having the similarity ratio AC 1
AC = cos(BAC) = 2 . It follows
\
that the similarity ratio is the same with the ratio of the diameters of the circumcircles
of triangles AB 0 C 0 and ABC, so AH 1
2R = 2 , which leads to AH = R = AO. (1)

It is known that the rays (AH and (AO are isogonal, so ∠BAO ≡ ∠CAH. (2)
From (1) it results that ∠AOH ≡ ∠AHO, so ∠AOD ≡ ∠AHE. Using (1) and
(2), it follows that triangles AOD and AHE are congruent, so AD = AE and the
conclusion follows.

15
16 S ELECTION TESTS FOR THE 2016 JBMO

Problem 2. Let m, n be positive integers and x, y, z ∈ [0, 1] be real numbers.

Prove that

0 ≤ xm+n + y m+n + z m+n − xm y n − y m z n − z m xn ≤ 1

and find when equality holds.
adapted from Lituanian Olympiad

Solution. (Dan Schwarz)

Without loss of generality, we my assume that x is the largest of x, y, z; then we have:
xm+n + y m+n + z m+n − xm y n − y m z n − z m xn = (xm − z m )(xn − y n ) + (y m −
z m )(y n − z n ) ≥ 0.
The minimum is 0 and is obtained if x = max{y, z} and y = z, so if x = y = z.
The maximum is achieved for x = 1, and its value is
1 + y m+n + z m+n − y n − y m z n − z m = 1 − y n (1 − y m ) − z m (1 − z n ) − y m z n ≤ 1,
with equality only if one of y or z is 0 and the other one is 0 or 1.
Therefore, there are 6 equality cases, namely
(x, y, z) ∈ {(1, 0, 0), (0, 1, 0), (0, 0, 1), (1, 1, 0), (1, 0, 1), (0, 1, 1)}.

Problem 3. Let M be the set of the natural numbers k for which it exists n ∈ N
such that the remainder of 3n when divided by n is k. Show that M is infinite.
Ioan-Laurenţiu Ploscaru
S ELECTION TESTS FOR THE 2016 JBMO 17

j
Solution. Let j be a fixed positive integer and p > 2 a prime so that 2j p > 32 .
j j
Then 32 (32 (p−1) − 1) ≡ 0 (mod 2j p), because 2ϕ(2j p) = 2j (p − 1). Hence
j j j j
32 p ≡ 32 (mod 2j p), so, for n = 2j p, one has rn = 32 . It follows that 32 ∈ M ,
for all j ∈ N∗ , so M is an infinite set.

Alternative solution. Choosing n = 2 · 3j , the remainder rn of 3n when divided

by n verifies rn 6= 0, rn ≡ 0 (mod 3j ), so rn ≥ 3j (in fact rn = 3j ). Therefore, M
contains arbitrarily large numbers, so it is infinite.

Problem 4. Let ABC be an acute triangle with AB 6= AC. The incircle ω of

the triangle touches the sides BC, CA and AB in D, E and F , respectively. The
perpendicular line erected from C to BC intersects EF at M , and, similarly, the
perpendicular line erected at B to BC intersects EF at N . The line DM meets ω
again in P , and the line DN meets ω again in Q. Prove that DP = DQ.

Rubén Dario, Perú and Leonard Giugiuc, Romania

Solution. Let {T } = EF ∩ BC. Applying Menelaus’ theorem to the triangle

ABC and the transversal line E − F − T we obtain: TT B EC FA TB
C · EA · F B = 1, i.e. T C ·
s−c s−a TB s−b
s−a · s−b = 1, or T C = s−c , where the notations are the usual ones (1).
This means that triangles T BN and T CM are similar, therefore TT B BN
C = CM .
From (1) it follows that CM = s−c , CD = s−c , and ∠DBN = ∠DCM = 90◦ ,
BN s−b BD s−b

which means that triangles BDN and CDM are similar, hence angles BDN and
CDM are equal. This leads to the arcs DQ and DP being equal, and finally to
DP = DQ.

Alternative solution. Let S be the intersection point of the altitude from A with
the line EF . Lines BN, AS, CM are parallel, therefore triangles BN F and ASF
are similar, as are triangles ASE and CM E. We obtain BN BF AS
AS = F A and CM = EC .
AE

BN BF AE BF BD
Multiplying these two together, we obtain CM = FA · EC = EC = DC . (We have
used that AE = AF , BF = BD and CE = CD.)
It follows that the right triangles BDN and CDM are similar (SAS), which leads to
the same ending as in the first proof.
18 S ELECTION TESTS FOR THE 2016 JBMO

Problem 5. The unit squares of a n × n board, n ≥ 2, are colored either black or

white so that any black square has at least three white neighbors (a neighbor is a unit
square with a common side). What is the maximum number of black unit squares?
Andrei Eckstein

n2 −1 n2 −4
Solution. The answer is 2 if n is odd and 2 if n is even.

Notice that:
- the unit squares from the corners are white (because they only have two neighbors,
not three);
- the other squares from the border of the board have only three neighbors, so there
can’t be two consecutive black squares on the border;
- any 2 × 2 square contains at most two black squares (if not, a black square would
already have two black neighbors, so it would have at most two white neighbors).
If n is odd, color the board like a chessboard with white corners. This coloring sat-
2
isfies the requirements of the problem and it has n 2−1 black squares, so the maximum
2
number of black squares is at least n 2−1 .
On the other hand, split the board in 4 parts: one upper-left (n − 1) × (n − 1)
square, a unit square in the right bottom corner, a (n − 1) × 1 rectangle on the right
side and a 1 × (n − 1) rectangle on the bottom side. Tiling the (n − 1) × (n − 1) square
with 2 × 2 squares and the two rectangles with 2-square dominoes, according with the
2
n2 −1
remarks made at the beginning, one can have at most (n−1) 2 + n−1 n−1
2 + 2 +0 = 2
S ELECTION TESTS FOR THE 2016 JBMO 19

black squares.
n2 −1
It follows that if n is odd, the maximum number of black squares is 2 .

If n is even, again consider a chessboard-like coloring. This makes two white

corners and two black corners; recolor the black corners as white. The configuration
2
we have now satisfies the requirements of the problem and it has n 2−4 black squares,
2
so the maximum number of black squares is at least n 2−4 .

Split the board in 9 parts: one (n − 2) × (n − 2) square in the middle, four

unit squares in the corners and four (n − 2) × 1 or 1 × (n − 2) rectangles on the
borders. Tiling the (n − 2) × (n − 2) square with 2 × 2 squares and the rectangles
with 2-square dominoes, the remarks made at the beginning lead to a maximum of
(n−2)2 n2 −4
2 + 4 · n−2
2 +4·0 = 2 black squares. Hence, if n is even, the maximum
2
number of black squares is n 2−4 .

SECOND SELECTION TEST

Problem 6. Let O be the circumcircle of a triangle ABC. A circle k is tangent

to the lines BC, CA, AB at points D, E, F , respectively, such that A is on the other
side of the line BC with respect to the circle. Suppose the circle k is equal to the
circumcircle of the triangle. Prove that lines OD and EF are perpendicular.

Solution. Let Ia be the center of the circle k and let T be the midpoint of the arc
BC - not containing A - of the circumcircle ABC. Notice that OT is the perpen-
dicular bisector of the line segment BC to deduce that OT ⊥ BC. As Ia D ⊥ BC
and OT = Ia D = R, the quadrangle ODIa T is a parallelogram. Consequently
OD k T Ia , or, equivalently, OD k AIa .
On the other hand, since AE = AF and (AIa bisects angle ∠F AE, the lines AIa
and EF are perpendicular, and so are lines OD and EF .
20 S ELECTION TESTS FOR THE 2016 JBMO

1
Problem 7. Let a, b, c be positive numbers with abc ≥ 1. Prove that a3 +2b3 +6 +
1 1 1
b3 +2c3 +6 + c3 +2a3 +6 ≤ 3 .

Ionuţ Grigore

Solution. Notice that a3 + b3 + 1 ≥ 3ab and b3 + 1 + 1 ≥ 3b to obtain

1 1 1 1
that a3 +2b 3 +6 ≤ 3ab+3b+3 , hence it is sufficient to show that ab+b+1 + bc+c+1 +
1
ca+a+1 ≤ 1.
1 1 1 1 ab
To this end, observe that ab+b+1 + bc+c+1 + ca+a+1 = ab+b+1 + ab2 c+abc+ab +
abc≥1
b 1 ab b 1+ab+b
abc+ab+b ≤ ab+b+1 + b+1+ab + 1+ab+b = ab+b+1 = 1.

Solution. Subtract 1/6 from

 each of the left hand-side summands and write suc-
P 1 1 1 1
P −a3 −2b3 1
cessively a3 +2b3 +6 − 6 ≤ 3 − 2 , then 6(a3 +2b3 +6) ≤ − 6 or further
cyc cyc
P a3 +2b3
3 3
a +2b +6 ≥ 1.
cyc
a3 1 b3
≥ 31 .
P P
It is sufficient to prove that a3 +2b3 +6 ≥ 3 and a3 +2b3 +6
cyc cyc
CBS
a3 a4
P P
To this end, notice that a3 +2b3 +6 = a4 +2ab3 +6a ≥
cyc cyc
(1)
(a2 +b2 +c2 )2 1
a4 +b4 +c4 +2(ab3 +bc3 +ca3 )+6(a+b+c) ≥ 3.

The inequality (1) rewrites 3(a4 +b4 +c4 )+6(a2 b2 +b2 c2 +c2 a2 ) ≥ a4 +b4 +c4 +
S ELECTION TESTS FOR THE 2016 JBMO 21

2(ab3 +bc3 +ca3 )+6(a+b+c), and follows from 2(a4 +b4 +c4 ) ≥ 2(ab3 +bc3 +ca3 )
and 6(a2 b2 +b2 c2 +c2 a2 ) ≥ 6(ab·bc+bc·ca+ca·ab) = 6abc(a+b+c) ≥ 6(a+b+c).
CBS
b3 b4
P P
On the other hand, a3 +2b3 +6 = ba3 +2b4 +6b ≥
cyc cyc
2 2 2 2 (2)
(a +b +c ) 1
2(a4 +b4 +c4 )+(ba3 +cb3 +ac3 )+6(a+b+c) ≥ 3. The inequality (2) rewrites 3(a4 +
b4 + c ) + 6(a b + b c + c a ) ≥ 2(a + b4 + c4 ) + (ba3 + cb3 + ac3 ) + 6(a + b + c),
4 2 2 2 2 2 2 4

and follows from a4 + b4 + c4 ≥ ba3 + cb3 + ac3 and 6(a2 b2 + b2 c2 + c2 a2 ) ≥

6(ab · bc + bc · ca + ca · ab) = 6abc(a + b + c) ≥ 6(a + b + c).
1
Solution. As a3 + 2b3 = a3 + b3 + b3 ≥ 3ab2 , it suffices to prove that ab2 +2 +
2 2 2
1 1
bc2 +2 + ca2 +2 ≤ 1. Rewrite the inequality as − 2(abab2 +2) − 2(bcbc2 +2) − 2(caca2 +2) ≤ 1− 32 ,
2
bc2 ca2
or, equivalently, abab2 +2 + bc2 +2 + ca2 +2 ≥ 1.
2
bc2 ca2
Recall that abc ≥ 1, and write ab2ab
+2abc + bc2 +2abc + ca2 +2abc ≥ 1 to observe that
b c a b c a
it is enough to show that b+2c + c+2a + a+2b ≥ 1. Indeed, b+2c + c+2a + a+2b =
2 2 2 CBS 2
b c a (a+b+c)
b2 +2bc + c2 +2ca + a2 +2ab ≥ b2 +2bc+c 2 +2ca+a2 +2ab = 1, which concludes the

proof.

Problem 8. Let n be an integer greater than 2 and consider the set A = {2n −
1, 3n − 1, . . . , (n − 1)n − 1}. Given that n does not divide any element of A, prove
that n is a square-free number. Does it necessarily follow that n is a prime number?
Marius Bocanu

Solution. Suppose not and write n = pa for a prime p and a number a > 1 with
p | a. Notice that (a + 1)n − 1 = a((a + 1)n−1 + (a + 1)n−2 + . . . + 1) and a + 1 ≡ 1
(mod p) to infer that n divides (a + 1)n − 1, a contradiction.
Further, n needs not be a prime number; take for example n = 15 = 3 · 5.

Remark.
All primes n meet the requirements of the problem, and the value n = 15 shows that
not only the primes satisfy the conditions. Furthermore, not all square-free numbers
have the property from the problem, as n = 6 = 2 · 3 shows.

Problem 9. All the 16 squares of a 4 × 4 array are white. Define a move by

selecting a rectangle 1 × 3 or 3 × 1 and switching the colors of each of its squares
from white to black or from black to white. Is it possible that all squares turn black
after a sequence of moves?
22 S ELECTION TESTS FOR THE 2016 JBMO

Solution. Fill the array with numbers as follows:

1 2 3 1
2 3 1 2
3 1 2 3
1 2 3 1
to observe that a move will change colors in one square of each number. As
initially there are six squares labeled 1, an even number of moves is required to turn
black all these squares. On the other hand, five squares where labeled with 2 at the
start, requiring an odd number of moves to turn all black, hence the answer is negative.

THIRD SELECTION TEST

Problem 10. For n ∈ N, consider the system

(
x2 + ny 2 = z 2
(Sn ) : , x, y, z, t ∈ N.
nx2 + y 2 = t2

If M1 = {n ∈ N | system (Sn ) has infinitely many solutions}, and

M2 = {n ∈ N | system (Sn ) has no solutions}, prove that:
a) 7 ∈ M1 , 10 ∈ M2 ,
b) sets M1 and M2 are infinite.

Solution. a) Notice that x = 1, y = 3, z = 8, t = 4 is a solution to the system

(S7 ), and so is (k, 3k, 8k, 4k), for any k ∈ N, hence 7 ∈ M1 .
If (x, y, z, t) is a solution to the system (S10 ), it would follow that 11(x2 + y 2 ) =
z 2 + t2 . From 11 | z 2 + t2 we get 11 | z and 11 | t. Then 11 | x2 + y 2 , hence 11 | x
and 11 | y. Therefore, there exist x1 , y1 , z1 , t1 ∈ N such that x = 11x1 , y = 11y1 ,
z = 11z1 , t = 11t1 . This leads to 11(x21 + y12 ) = z12 + t21 . By continuing this
procedure (,,infinite descent”), we get that x is a multiple of any power of 11, and, as
x 6= 0, we arrive to a contradiction. In conclusion, the system (S10 ) has no solutions,
i.e. 10 ∈ M2 .
b) It is easy to see that any number n of the form m2 − 1, m ∈ N, belongs to M1 : we
S ELECTION TESTS FOR THE 2016 JBMO 23

can choose x = y and notice that (k, k, mk, mk), k ∈ N, are solutions to the system
(Sm2 −1 ), hence m2 − 1 ∈ M1 , ∀ m ∈ N.
Applying the same steps as we did above for n = 10, it is easy to prove that if p is a
prime of the form 4m + 3, and n = p − 1, then n ∈ M2 . As there are infinitely many
such primes, the conclusion follows readily.
One can prove that actually any number congruent to 2 (mod 4) belongs to M2 .

Problem 11. Let x and y be be real nonzero numbers, such that x3 +y 3 +3x2 y 2 =
x y . Determine the set of the possible values of E = x1 + y1 .
3 3

Solution. Rewrite the given condition successively (x + y)3 − 3xy(x + y) =

x y − 3x2 y 2 , i.e. (x + y)3 − (xy)3 = 3xy(x + y) − 3x2 y 2 , or (x + y − xy)(x2 +
3 3

2xy + y 2 + x2 y + xy 2 + x2 y 2 ) = 3xy(x + y − xy). We either have x + y = xy, which

leads to E = 1 (obtained for x = y = 2), or x2 +2xy +y 2 +x2 y +xy 2 +x2 y 2 = 3xy.
The last equality, multiplied by 2, can be written equivalently x2 (y + 1)2 + y 2 (x +
1)2 + (x − y)2 = 0, which is possible if and only if x = y = −1 (x = y = 0 is
forbidden). In this case, E = −2. In conclusion, the set of the possible values of E is
{−2, 1}.

Problem 12. Let ABCD be a cyclic quadrilateral whose diagonals are not per-
pendicular and intersect at X. Let A0 , C 0 be the projections of A and C onto the line
BD and let B 0 , D0 be the projections of B and D onto AC. Prove that:
a) the perpendicular lines drawn from the midpoints of the sides onto the opposite
sides are concurrent at a point called Mathot’s point;
b) points A0 , B 0 , C 0 , D0 are cocyclic;
c) if O0 is the circumcenter of A0 B 0 C 0 , then O0 is the midpoint of the line segment
determined by the orthocenters of triangles XAB and XCD;
d) O0 is the Mathot point of the quadrilateral ABCD.

Solution. a) Let O be the circumcenter of ABCD. It is well known that the mid-
points of the sides of a quadrilateral ABCD are the vertices of a parallelogram, hence
the line segments joining the midpoints of two opposite sides have the same midpoint,
G. The perpendicular lines from O to AB and CD pass through the midpoints of
these sides, therefore the perpendiculars dropped from O and from the midpoints of
24 S ELECTION TESTS FOR THE 2016 JBMO

two opposite sides onto the their opposite side form a parallelogram whose center is
G. It follows that the two perpendicular lines dropped from the midpoints of two op-
posite sides onto their opposite side intersect at the reflection of O in G. The other
two perpendiculars intersect at the same point.
b) We assume the angle AXB to be acute, the other case being similar. The quadri-
laterals ABA0 B 0 , CDC 0 D0 and ABCD being cyclic, we have
∠XD0 C 0 ≡ ∠XDC ≡ ∠XAB ≡ ∠XA0 B 0 , hence A0 B 0 C 0 D0 is cyclic.
c) Let H1 and H2 be the orthocenters of triangles XAB, and XCD, respectively.
If O00 is the midpoint of [H1 H2 ], as O00 belongs to the midsegment of the trapezoid
H1 B 0 H2 D0 , O00 belongs to the perpendicular bisector of the line segment [B 0 D0 ].
Similarly, O00 belongs to the midsegment of the trapezoid A0 H1 C 0 H2 , hence to the
perpendicular bisector of [A0 C 0 ]. As A0 C 0 and B 0 D0 are not parallel, it follows that
O00 is precisely the circumcenter of A0 B 0 C 0 D0 , i.e. O00 coincides with O0 .
d) We have ∠A0 B 0 X ≡ ∠ABX ≡ ∠DCX, hence A0 B 0 k CD. If N is the midpoint
of [AB], then N A0 = N B 0 , hence N belongs to the perpendicular bisector of [A0 B 0 ].
But so does O0 , therefore it follows that N O0 ⊥ CD. Similarly, O0 belongs to the
perpendicular dropped from the midpoint of [CD] on AB, hence O0 is the Mathot
point of the quadrilateral.

Problem 13. In every unit square of an n × n board a positive integer is written.

A move consists of choosing a 2 × 2 square and adding 1 to exactly three of the four
S ELECTION TESTS FOR THE 2016 JBMO 25

number written in the chosen square. We call a positive integer n good if starting from
any initial numbers, there is a sequence of moves that makes all the numbers from the
board equal.
a) Prove that n = 6 is not good.
b) Prove that n = 4, and n = 1024 are good.

Solution. a) Let us notice that the sum of the 36 numbers written on the board
is invariant modulo 3. When all the numbers on the board are equal, their sum is a
multiple of 36, hence a multiple of 3. But this requires that the initial sum is also a
multiple of 3. In conclusion, if the sum of the initial numbers is not a multiple of 3,
there is no succession of moves that makes the numbers equal. In conclusion, 6 is not
good.
b) For n=4, we chose an arbitrary unit square and prove that we can increase by 1 all
the other 15 numbers from the board. For example, if the chosen square lies in the
upper left 2 × 2 corner, we successively increment the numbers in the squares marked
with B, then those marked by C, D, and E. Finally, we increment 3 of the four numbers
in the squares marked with A (with the exception of the chosen one). Thus, combin-
ing five moves, we have obtained a move that is equivalent to decreasing the chosen
number by 1.

A A B B
A A C B
D C C E
D D E E
Repeating this new move and choosing each time the largest number (or one of those
if there are several largest ones), we can make the numbers equal.
For n a power of 2, in particular for n = 210 = 1024, we prove by induction that any
2k × 2k board (k ≥ 1) from which an arbitrary unit square has been removed, can
be tiled with non-overlapping L-shaped trominos (figures obtained by removing a unit
square from a 2 × 2 square).
The possibility of tiling such ,,deficient squares” with L-shaped trominos is a classical
problem due to Golomb. We reproduce the proof from
http://www.cut-the-knot.org/Curriculum/Geometry/Tromino.shtml
For k = 1 the statement is obvious.
26 S ELECTION TESTS FOR THE 2016 JBMO

Assume the statement true for n = 2k−1 and let us prove it for n = 2k . Draw the
center lines of the 2k × 2k board. The cut-off square lies in exactly one of the four
thus obtained 2k−1 × 2k−1 boards. We may remove one square from each of the other
three boards by placing a tromino at the center of the 2k × 2k board. The result is a
tromino and four 2k−1 × 2k−1 boards, each with one square removed - just a situation
to apply the inductive hypothesis.
This tiling allows us to construct a sequence of moves that increases by 1 the number
in every square with the exception of one square that can be arbitrarily chosen. By
repeatedly using such sequences we can make all the numbers of the board equal.

FOURTH SELECTION TEST

Problem 14. The altitudes AA1 , BB1 , CC1 of the acute triangle ABC intersect at
H. Let A2 be the reflection of point A in the line B1 C1 and let O be the circumcenter
of triangle ABC.
a) Prove that the points O, A2 , B1 , C are cocyclic.
b) Prove that the points O, H, A1 , A2 are cocyclic.

∗ ∗ ∗

Solution. a) The angles ∠ABC and ∠AB1 C1 are equal, therefore so are their
complementary angles, ∠BAA1 and ∠A2 AC. It follows that the rays (AH and (AA2
are isogonal, hence A2 ∈ (AO. As AO = CO, we have ∠ACO ≡ ∠OAC ≡
∠AA2 B1 , therefore points O, A2 , B1 , C are cocyclic. (The arguments above hold in
the case A2 ∈ (AO) as well as in the case O ∈ (AA2 ).)
b) From the power of the point A with respect to the circles through O, A2 , B1 , C and
H, A1 , C, B1 respectively, it follows that AB1 · AC = AO · AA2 and AB1 · AC =
AH · AA1 . Since AO · AA2 = AH · AA1 , from the converse of the power of the point
theorem, it follows that the points O, A2 , H, A1 are cocyclic.
S ELECTION TESTS FOR THE 2016 JBMO 27

Alternative solution: for b)

Consider {A3 } = (AA2 ∩ B1 C1 and let O1 be the midpoint of [AH]. Then O1 is the
circumcenter of triangle AB1 C1 . As [O1 A3 ] is a midsegment in triangle AHA2 , we
have ∠HA2 A ≡ ∠O1 A3 A. But the similarity of triangles ABC and AB1 C1 leads
to the equality of the corresponding angles ∠AA1 O and ∠AA3 O1 , which means that
∠AA2 H ≡ ∠AA1 O and the conclusion.
Remark: The result remains valid even when the triangle ABC is not acute.

Problem 15. We are given an m × n grid and three colors. We wish to color each
segment of the grid with one of the three colors so that each unit square has two sides
of one color and two sides of a second color. How many such colorings are possible?
∗ ∗ ∗

Solution. We label the lines from top to bottom and the columns from left to right.
The leftmost side of the unit square in the upper-left corner can be colored in 3 ways.
Subsequently, there are 3 ways of choosing the side of this unit square that is to re-
ceive the same color as the first side. The remaining two sides of the square have to be
colored with the same color. This color can be chosen in 2 ways. In conclusion, the
unit square in the upper-left corner can be colored in 3 · 3 · 2 = 18 ways.
Next, we successively color the unit squares in the first line, from left to right. Every
time, the leftmost side of the square has already been colored. Thus, there are 6 ways
28 S ELECTION TESTS FOR THE 2016 JBMO

of coloring each of these squares. We proceed similarly on the first column. We color
the unit squares from top to buttom and for each of these squares there are 6 ways of
coloring.
Now we move on to color the squares situated on rows 2, 3, . . . , m and columns
2, 3, . . . , n. We color them from top to bottom, from left to right. Thus, when in
turn to be colored, each unit square has already two sides colored: the upper side and
the leftmost side. If these sides have received different colors, then the colors of this
square have already been decided; there are 2 ways of coloring the remaining sides
with these two colors. If the two sides that are already colored, have the same color,
then the remaining sides will receive the same color. This color can be chosen in 2
ways. Therefore, for each of these squares, there are 2 ways of coloring.
In conclusion, there are 18·6m−1 ·6n−1 ·2(m−1)(n−1) = 3m+n ·2mn ways of coloring.

Problem 16. Real numbers a, b and c are such that a, b ≥ 1 ≥ c ≥ 0 and

a + b + c = 3.
a) Show that 2 ≤ ab + bc + ca ≤ 3.
24 25
b) Prove the inequality a3 +b3 +c3 + ab+bc+ca ≥ 14 and determine the equality cases.
Leonard Giugiuc

Solution. a) Denote ab + bc + ca = q and abc = p. As (1 − a)(1 − b)(1 − c) ≥ 0,

it follows that q − 2 ≥ p; but p ≥ 0, hence q ≥ 2. As 3(ab + bc + ca) ≤ (a + b + c)2 ,
we obtain q ≤ 3.
b) a3 + b3 + c3 = (a + b + c)3 − 3(a + b + c)(ab + bc + ca) + 3abc = 3(9 − 3q + p);
from a), p ≤ q − 2 ⇒ 3(9 − 3q + p) ≤ 3(7 − 2q) ⇒ a3 +b243 +c3 ≥ 7−2q 8
. It is enough
8 25 2
to show that 7−2q + q ≥ 14, which is equivalent to 7(2q − 5) ≥ 0, which is clearly
true.
Equality holds if and only if p = q − 2 and q = 52 , p = 12 .
But p = q − 2 leads to (1 − a)(1 − b)(1 − c) = 0, i.e. at least one of the numbers
a, b, c is equal to 1.
Denote by x and y the two remaining numbers. Then

 x + y + xy = 5
2
 xy = 12 .

Solving the system, we obtain a = 1 + √1 , b = 1 and c = 1 − √1 .

2 2
S ELECTION TESTS FOR THE 2016 JBMO 29

Problem 17. Let ABCD be a cyclic quadrilateral, and let E and F denote the
midpoints of diagonals [AC] and [BD], respectively. If {G} = AB ∩ CD, {H} =
AD ∩ BC, prove that:
a) the intersection points of the angle bisectors of ∠AHB and ∠AGD with the sides
of the quadrilateral ABCD are the vertices of a rhombus;
b) the center of this rhombus lies on the line EF .

adapted by Andrei Eckstein and Mircea Fianu

Solution. We are going to treat only the case when C ∈ (GD) and C ∈ (BH),
all the other cases being similar.
a) Let M and N be the intersection points of the angle bisector of angle ∠G with the
sides BC and AD, respectively. Consider I, K the intersection points of the angle bi-
sector of angle ∠H with sides CD and AB, respectively. Also, put {J} = M N ∩IK.
From triangle GBC we get ∠G = 180◦ − ∠GBC − ∠GCB = ∠B + ∠C − 180◦ ,
hence ∠CM J = 90◦ + 21 (∠B − ∠C). Similarly, ∠CIJ = 90◦ + 21 (∠D − ∠C).
From the quadrilateral CM JI, using the fact that ∠B + ∠D = 180◦ , it follows that
∠M JI = 90◦ .
In the triangles GIK and HM N , line segments [GJ] and [HJ] are angle bisectors
and altitudes, therefore they are also medians. Thus, the diagonals of the quadrilateral
M KN I are perpendicular and bisect each other.
b) The sides of the rhombus are parallel to AC and BD, respectively. Indeed, accord-
ing to the angle bisector theorem, M B GB BK HB
M C = GC and KA = HA . But from the power of
the point G with respect to the circle, GB GD
GC = GA . In order to prove that M K k AC,
BK BM
i.e. KA = M C , it is sufficient to prove that HA · GD = HB · GA. This follows from
[AHG] = HA·GD 2
sin D
= HB·GA 2
sin B
and sin B = sin D. Thus, M K k AC.
Consider {L} = M K ∩ BF , {P } = AE ∩ KN , {O} = DF ∩ IN and {Q} =
M I ∩ CE. Line segments AE, BF , CE and DF are medians in triangles ABD,
ABC, BCD, CDA, therefore LO and P Q meet in the center of the rhombus.
Put {X} = LO ∩ EF and{Y } = QP ∩ EF . Then XE LB
XF = LF = KA and
BK

YE QE BM BK BM
Y F = QC = M C . As KA = M C , it follows that points X and Y coincide, which
means that the lines EF , LO and P Q pass through the center of the rhombus.
30 S ELECTION TESTS FOR THE 2016 JBMO
THE DANUBE MATHEMATICAL COMPETITION

Călăraşi, October 2013

Problem 1.

Solution.

Problem 2.

Solution.

Problem 3.

Solution.

Problem 4.

Solution.

31
32 2011 DANUBE M ATHEMATICAL C OMPETITION
THE Tenth IMAR MATHEMATICAL COMPETITION

Bucureşti, S. Haret National College, November 2013

Problem 1.

Solution.

Problem 2.

Solution.

Problem 3.

Solution.

Problem 4.

Solution.

33
34 2011 IMAR M ATHEMATICAL C OMPETITION
THE Sixth STARS OF MATHEMATICS COMPETITION

Bucureşti, ICHB High School, December 2013

Problem 1.

Solution.

Problem 2.

Solution.

Problem 3.

Solution.

Problem 4.

Solution.

JUNIORS

Problem 1.

Solution.

35
36 2012 “S TARS ” M ATHEMATICAL C OMPETITION

Problem 2.

Solution.

Problem 3.

Solution.

Problem 4.

Solution.
THE Sixth ROMANIAN MASTER OF MATHEMATICS

Bucureşti, T. Vianu National College, March 2016

FIRST DAY

Problem 1.

Solution.

Problem 2.

Solution.

Problem 3.

Solution.

Problem 4.

Solution.

37