45

A
EL
AL
R
PA
A
R
U
IT
ED

10 Years of Romanian Mathematical Competitions

 45
A
EL
Redactare: Daniel Mitran
Tehnoredactare: Mihai Monea
AL
Pregătire de tipar & design copertă: Marius Badea
R
PA

Descrierea CIP a Bibliotecii Naţionale a României

A

GOLOGAN, RADU
R

10 Years of Romanian Mathematical Competitions / Radu Gologan, Dan Ştefan

Marinescu, Mihai Monea. - Piteşti : Paralela 45, 2018
Index
U

ISBN 978-973-47-2720-9
IT

I. Marinescu, Dan-Ştefan
II. Monea, Mihai
ED

51

Copyright © Editura Paralela 45, 2018

 45
A
EL
AL
R
PA
A
R
U
IT
ED

Editura Paralela 45
Contents

Preface . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7

45
Members of the RMC Editorial Board . . . . . . . . . . . . . . . . . . . . . . . . . 8
Abbreviations and Notations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
Algebra . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11

A
1.1. Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11

EL
1.2. Solutions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18
Combinatorics. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .37
2.1. Problems. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37
AL
2.2. Solutions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 44
Geometry . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 69
R

3.1. Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 69
3.2. Solutions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 76
PA

Number Theory . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 99
4.1. Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 99
4.2. Solutions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 105
A

Calculus . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 121
R

5.1. Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 121

5.2. Solutions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 129
U

Higher Algebra . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 151

IT

6.1. Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 151

6.2. Solutions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 157
ED

Authors Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 173

Preface

In 1997, Mircea Becheanu and Bogdan Enescu, then strongly involved in

the training and participation of the Romanian teams in the International
Mathematical Olympiads had the idea to produce an annual booklet that

45
should contain the problems given at the National Mathematical Olympiads
and at the Romanian selection tests. Every year since, the book was o¤ered

A
to the leaders and deputy leaders at the IMOs.
It seemed that Romanian Mathematical Competitions, the title chosen

EL
for the booklet, became in years a great success. More than 100 problems
are completely discussed and more than 60 authors are present. The Editors
AL
of the booklet are known mathematicians in the problem solving domain in
Romania.
The 59th IMO, to be held in Cluj-Napoca this year, gave us the oppor-
R

tunity to celebrate the last 10 years of the RMC book with a selection of
PA

the nicest problem used in competitions in the last 10 years, problems that
were proposed by Romanian authors. We decided to categorize the problems
following the IMO-shortlist: algebra, combinatorics, geometry and number
A

theory. Given that the terminal classes in the Romanian Curriculum study
analysis and abstract algebra, we invented the Putnam category.
R

Many thanks are due to all people involved in the 20 years of the RMC.
U

But mostly we are grateful to Mircea Becheanu, C¼ alin Popescu, Marean An-
dronache, Dinu Şerb¼ anescu, Barbu Berceanu, Mihai B¼ alun¼
a, Bogdan Enescu
IT

and of course our great friend and talented mathematician who was Dan
ED

Schwarz. The work of Alex Negrescu completed the LaTeX version of the
last years’editions.
We strongly hope that this book will be useful for many countries in
training their gifted students for the International Mathematical Olympiads.

Radu Gologan
President of the Romanian Mathematical Society
Algebra
1.1. Problems
A1. We say that the function f : Q+ ! Q has property P if

45
f (xy) = f (x) + f (y);

for any x; y 2 Q+ :

A
a) Prove that there are no one-to-one functions with property P;

EL
b) Does there exist onto functions with property P?
AL Bogdan Moldovan - ONM 2017

p p
A2. Determine all integers n 2 such that a + 2 2 Q and an + 2 2 Q;
for some real number a depending on n:
R

Mihai B¼
alun¼
a - tIMO 2017
PA

A3. Let a 2 N; a > 2: Prove that the following statements are equivalents:
a) One can …nd b; c 2 N such that a2 = b2 + c2 ;
b) One can …nd d 2 N ; such that the equations x2 ax + d = 0 and
A

x2 ax d = 0 have integer roots.

R

Vasile Pop - OJM 2016

U

A4. a) Prove that there exist non-periodical functions f : R ! R such

IT

that
p
f (x + 1) + f (x 1) = 5f (x) ;
ED

for all x 2 R;
b) Prove that any function g : R ! R such that
p
g (x + 1) + g (x 1) = 3g (x) ;

for all x 2 R; is periodical.

Vasile Pop - OJM 2016
12 10 Years of Romanian Mathematical Competitions

A5. Let f : R ! R be a function with the following properties:

(P 1) : f (x + y) 6 f (x) + f (y)

and
(P 2) : f (tx + (1 t) y) 6 tf (x) + (1 t) f (y) ;

45
for all x; y 2 R and t 2 [0; 1] :
a) Prove that

A
f (b) + f (c) 6 f (a) + f (d) ;

EL
for any a 6 b 6 c 6 d such that d c = b a;
b) Prove that
! !
AL
X n Xn X
f xk + (n 2) f (xk ) > f (xi + xj ) ;
k=1 k=1 16i<j6n
R

for all n 2 N; n > 3; and x1 ; x2 ; :::; xn 2 R:

PA

Nicolae Bourb¼
acuţ - ONM 2016

A6. Determine all functions f : N ! N ; such that f (m) > m and

A

f (m + n) divides f (m) + f (n); for all m; n 2 N :

Marius Cavachi - tIMO 2016
R
U

A7. Find all real numbers a and b such that the equality
IT

bax + byc + bbx + ayc = (a + b)bx + yc

ED

holds, for every x; y 2 R:

Lucian Dragomir - OJM 2015

A8. A quadratic function f sends any interval I of length 1 to an interval

f (I) of length at least 1: Prove that for any interval J of length 2; the length
of the interval f (J) is at least 4:
Mihai B¼
alun¼
a - ONM 2015
Algebra 13

A9. Let a be a natural odd number which is not a perfect square. If

m; n 2 N prove that:
p p
a) fm (a + a)g 6= fn (a a)g ;
p p
b) bm (a + a)c 6= bn (a a)c.
Vasile Pop - ONM 2014

45
A10. Consider the function f : N ! N which satis…es the properties:
a) f (1) = 1;

A
b) f (p) = 1 + f (p 1); for any prime number p;

EL
c) f (p1 p2 pn ) = f (p1 ) + f (p2 ) + + f (pn ); for any prime numbers
p1 ; p2 ; :::; pn ; not necessary distinct.
Prove that 2f (n) n3 3f (n) ; for any n 2 N; n 2:
AL
George Stoica - ONM 2014
R

A11. Find all functions f; g : Q ! Q such that

PA

f (g (x) + g (y)) = f (g (x)) + y

and
g (f (x) + f (y)) = g (f (x)) + y;
A
R

for all x; y 2 Q:
Vasile Pop - ONM 2015
U
IT

A12. Let n 2 N; n 2: Prove that there exist n + 1 pairwise distinct

numbers x1 ; x2 ; :::; xn ; xn+1 2 Q n Z such that
ED

fx31 g + fx32 g + + fx3n g = fx3n+1 g;

where fxg denotes the fractional part of the real number x:

Dorel Miheţ - tIMO 2014

A13. Given an odd prime p; determine all polynomials f and g; with

P
integral coe¢ cients, satisfying the condition f (g(X)) = pk=01 X k :
Cezar Lupu & Vlad Matei - tIMO 2014
1.2. Solutions
A1. a) For x = y = 1 we obtain f (1) = 0: For x = y we get f (x2 ) = 2f (x);
and it is not di¢ cult to prove that f (xn ) = nf (x); for all n 2 Z and x 2 Q+ :
Let p and q be two distinct prime numbers. We could …nd a; b; c 2 Z
a b
such that f (p) = and f (q) = : Then

45
c c

b f (pb ) a f (q a )
f (p)f (q) = f (p) = = f (q) = :

A
c c c c

EL
If f were one-to-one, then pb = q a ; and thus a = b = 0; which is a contra-
diction.
b) If x > 0 is a rational number, we can uniquely …nd the distinct prime
AL
numbers p1 ; p2 ; :::; pn and a1 ; a2 ; : : : ; an 2 N such that x = pa11 pa22 : : : pann : It
is easy to check that
R

f (x) = a1 f (p1 ) + a2 f (p2 ) + : : : + an f (pn );

PA

so it will be enough to de…ne the function f on the set of prime numbers.

De…ne the function f by
A

1
f (p) = ;
p!
R

a
for any prime number p: Then, for any a 2 Z; we have f (pa ) = : We
U

p!
a
prove that f is an onto function. Let y 2 Q; y = ; with a; b 2 Z: Choose a
IT

b
a
prime number p; large enough such that b divides p!: Then p!y = p! 2 Z;
b
ED

and thus
p!y
f (pp!y ) = = y:
p!

A2. There is only one such n; namely n = 2; in which case we may take

1 p
a= 2:
2
Veri…cation is routine and hence omitted.