MathDB
Problems
Contests
International Contests
European Mathematical Cup
2019 European Mathematical Cup
2019 European Mathematical Cup
Part of
European Mathematical Cup
Subcontests
(4)
3
1
Hide problems
Prove that if they're concur, then it must be orthocenter
In an acute triangle
A
B
C
ABC
A
BC
with
∣
A
B
∣
≠
∣
A
C
∣
|AB| \not= |AC|
∣
A
B
∣
=
∣
A
C
∣
, let
I
I
I
be the incenter and
O
O
O
the circumcenter. The incircle is tangent to
B
C
‾
,
C
A
‾
\overline{BC}, \overline{CA}
BC
,
C
A
and
A
B
‾
\overline{AB}
A
B
in
D
,
E
D,E
D
,
E
and
F
F
F
respectively. Prove that if the line parallel to
E
F
EF
EF
passing through
I
I
I
, the line parallel to
A
O
AO
A
O
passing through
D
D
D
and the altitude from
A
A
A
are concurrent, then the point of concurrence is the orthocenter of the triangle
A
B
C
ABC
A
BC
.Proposed by Petar Nizié-Nikolac
4
2
Hide problems
Sequence of Rational Numbers
Let
u
u
u
be a positive rational number and
m
m
m
be a positive integer. Define a sequence
q
1
,
q
2
,
q
3
,
…
q_1,q_2,q_3,\dotsc
q
1
,
q
2
,
q
3
,
…
such that
q
1
=
u
q_1=u
q
1
=
u
and for
n
⩾
2
n\geqslant 2
n
⩾
2
:
if
q
n
−
1
=
a
b
for some relatively prime positive integers
a
and
b
,
then
q
n
=
a
+
m
b
b
+
1
.
\text{if }q_{n-1}=\frac{a}{b}\text{ for some relatively prime positive integers }a\text{ and }b, \text{ then }q_n=\frac{a+mb}{b+1}.
if
q
n
−
1
=
b
a
for some relatively prime positive integers
a
and
b
,
then
q
n
=
b
+
1
a
+
mb
.
Determine all positive integers
m
m
m
such that the sequence
q
1
,
q
2
,
q
3
,
…
q_1,q_2,q_3,\dotsc
q
1
,
q
2
,
q
3
,
…
is eventually periodic for any positive rational number
u
u
u
.Remark: A sequence
x
1
,
x
2
,
x
3
,
…
x_1,x_2,x_3,\dotsc
x
1
,
x
2
,
x
3
,
…
is eventually periodic if there are positive integers
c
c
c
and
t
t
t
such that
x
n
=
x
n
+
t
x_n=x_{n+t}
x
n
=
x
n
+
t
for all
n
⩾
c
n\geqslant c
n
⩾
c
.Proposed by Petar Nizié-Nikolac
f(x)+f(yf(x)+f(y))=f(x+2f(y))+xy
Find all functions
f
:
R
→
R
f:\mathbb{R}\to \mathbb{R}
f
:
R
→
R
such that
f
(
x
)
+
f
(
y
f
(
x
)
+
f
(
y
)
)
=
f
(
x
+
2
f
(
y
)
)
+
x
y
f(x)+f(yf(x)+f(y))=f(x+2f(y))+xy
f
(
x
)
+
f
(
y
f
(
x
)
+
f
(
y
))
=
f
(
x
+
2
f
(
y
))
+
x
y
for all
x
,
y
∈
R
x,y\in \mathbb{R}
x
,
y
∈
R
. Proposed by Adrian Beker
2
2
Hide problems
Inequality on recurrence
Let
(
x
n
)
n
∈
N
(x_n)_{n\in \mathbb{N}}
(
x
n
)
n
∈
N
be a sequence defined recursively such that
x
1
=
2
x_1=\sqrt{2}
x
1
=
2
and
x
n
+
1
=
x
n
+
1
x
n
for
n
∈
N
.
x_{n+1}=x_n+\frac{1}{x_n}\text{ for }n\in \mathbb{N}.
x
n
+
1
=
x
n
+
x
n
1
for
n
∈
N
.
Prove that the following inequality holds:
x
1
2
2
x
1
x
2
−
1
+
x
2
2
2
x
2
x
3
−
1
+
…
+
x
2018
2
2
x
2018
x
2019
−
1
+
x
2019
2
2
x
2019
x
2020
−
1
>
201
9
2
x
2019
2
+
1
x
2019
2
.
\frac{x_1^2}{2x_1x_2-1}+\frac{x_2^2}{2x_2x_3-1}+\dotsc +\frac{x_{2018}^2}{2x_{2018}x_{2019}-1}+\frac{x_{2019}^2}{2x_{2019}x_{2020}-1}>\frac{2019^2}{x_{2019}^2+\frac{1}{x_{2019}^2}}.
2
x
1
x
2
−
1
x
1
2
+
2
x
2
x
3
−
1
x
2
2
+
…
+
2
x
2018
x
2019
−
1
x
2018
2
+
2
x
2019
x
2020
−
1
x
2019
2
>
x
2019
2
+
x
2019
2
1
201
9
2
.
Proposed by Ivan Novak
Beauty of a convex board
Let
n
n
n
be a positive integer. An
n
×
n
n\times n
n
×
n
board consisting of
n
2
n^2
n
2
cells, each being a unit square colored either black or white, is called convex if for every black colored cell, both the cell directly to the left of it and the cell directly above it are also colored black. We define the beauty of a board as the number of pairs of its cells
(
u
,
v
)
(u,v)
(
u
,
v
)
such that
u
u
u
is black,
v
v
v
is white, and
u
u
u
and
v
v
v
are in the same row or column. Determine the maximum possible beauty of a convex
n
×
n
n\times n
n
×
n
board.Proposed by Ivan Novak
1
2
Hide problems
Marking positive integers with 0,1, or 2
Every positive integer is marked with a number from the set
{
0
,
1
,
2
}
\{ 0,1,2\}
{
0
,
1
,
2
}
, according to the following rule:
if a positive integer
k
is marked with
j
,
then the integer
k
+
j
is marked with
0.
\text{if a positive integer }k\text{ is marked with }j,\text{ then the integer }k+j\text{ is marked with }0.
if a positive integer
k
is marked with
j
,
then the integer
k
+
j
is marked with
0.
Let
S
S
S
denote the sum of marks of the first
2019
2019
2019
positive integers. Determine the maximum possible value of
S
S
S
.Proposed by Ivan Novak
Find x,y that gcd(x+y,mn)>1
For positive integers
a
a
a
and
b
b
b
, let
M
(
a
,
b
)
M(a,b)
M
(
a
,
b
)
denote their greatest common divisor. Determine all pairs of positive integers
(
m
,
n
)
(m,n)
(
m
,
n
)
such that for any two positive integers
x
x
x
and
y
y
y
such that
x
∣
m
x\mid m
x
∣
m
and
y
∣
n
y\mid n
y
∣
n
,
M
(
x
+
y
,
m
n
)
>
1.
M(x+y,mn)>1.
M
(
x
+
y
,
mn
)
>
1.
Proposed by Ivan Novak