MathDB
Problems
Contests
International Contests
Rioplatense Mathematical Olympiad, Level 3
2016 Rioplatense Mathematical Olympiad, Level 3
2016 Rioplatense Mathematical Olympiad, Level 3
Part of
Rioplatense Mathematical Olympiad, Level 3
Subcontests
(6)
1
1
Hide problems
1008 numbers equal to 1, 1008 equal to -1, split into blocks, count sums, game
Ana and Beto play against each other. Initially, Ana chooses a non-negative integer
N
N
N
and announces it to Beto. Next Beto writes a succession of
2016
2016
2016
numbers,
1008
1008
1008
of them equal to
1
1
1
and
1008
1008
1008
of them equal to
−
1
-1
−
1
. Once this is done, Ana must split the succession into several blocks of consecutive terms (each term belonging to exactly one block), and calculate the sum of the numbers of each block. Finally, add the squares of the calculated numbers. If this sum is equal to
N
N
N
, Ana wins. If not, Beto wins. Determine all values of
N
N
N
for which Ana can ensure victory, no matter how Beto plays.
6
1
Hide problems
A_k is the number formed by the first k digits of sequence: 123456789101112 ...
When the natural numbers are written one after another in an increasing way, you get an infinite succession of digits
123456789101112....
123456789101112 ....
123456789101112....
Denote
A
k
A_k
A
k
the number formed by the first
k
k
k
digits of this sequence . Prove that for all positive integer
n
n
n
there is a positive integer
m
m
m
which simultaneously verifies the following three conditions: (i)
n
n
n
divides
A
m
A_m
A
m
, (ii)
n
n
n
divides
m
m
m
, (iii)
n
n
n
divides the sum of the digits of
A
m
A_m
A
m
.
4
1
Hide problems
max of |f(x) - f(y)|, when f:[0,1]\to R, f(0)=0,f(1)=1,|f(x) -f(y)|<= c|x - y|
Let
c
>
1
c > 1
c
>
1
be a real number. A function
f
:
[
0
,
1
]
→
R
f: [0 ,1 ] \to R
f
:
[
0
,
1
]
→
R
is called c-friendly if
f
(
0
)
=
0
,
f
(
1
)
=
1
f(0) = 0, f(1) = 1
f
(
0
)
=
0
,
f
(
1
)
=
1
and
∣
f
(
x
)
−
f
(
y
)
∣
≤
c
∣
x
−
y
∣
|f(x) -f(y)| \le c|x - y|
∣
f
(
x
)
−
f
(
y
)
∣
≤
c
∣
x
−
y
∣
for all the numbers
x
,
y
∈
[
0
,
1
]
x ,y \in [0,1]
x
,
y
∈
[
0
,
1
]
. Find the maximum of the expression
∣
f
(
x
)
−
f
(
y
)
∣
|f(x) - f(y)|
∣
f
(
x
)
−
f
(
y
)
∣
for all c-friendly functions
f
f
f
and for all the numbers
x
,
y
∈
[
0
,
1
]
x,y \in [0,1]
x
,
y
∈
[
0
,
1
]
.
2
1
Hide problems
\sqrt x +\sqrt y +\sqrt z=1, \sqrt{x+n} +\sqrt{y+n} +\sqrt{z+n} is an integer
Determine all positive integers
n
n
n
for which there are positive real numbers
x
,
y
x,y
x
,
y
and
z
z
z
such that
x
+
y
+
z
=
1
\sqrt x +\sqrt y +\sqrt z=1
x
+
y
+
z
=
1
and
x
+
n
+
y
+
n
+
z
+
n
\sqrt{x+n} +\sqrt{y+n} +\sqrt{z+n}
x
+
n
+
y
+
n
+
z
+
n
is an integer.
3
1
Hide problems
rioplatense perpendicularity
Let
A
B
C
A B C
A
BC
be an acute-angled triangle of circumcenter
O
O
O
and orthocenter
H
H
H
. Let
M
M
M
be the midpoint of
B
C
,
N
BC, N
BC
,
N
be the symmetric of
H
H
H
with respect to
A
,
P
A, P
A
,
P
be the midpoint of
N
M
NM
NM
and
X
X
X
be a point on the line A H such that
M
X
MX
MX
is parallel to
C
H
CH
C
H
. Prove that
B
X
BX
BX
and
O
P
OP
OP
are perpendicular.
5
1
Hide problems
Rio-Challenge
Initially one have the number
0
0
0
in each cell of the table
29
×
29
29 \times 29
29
×
29
. A moviment is when one choose a sub-table
5
×
5
5 \times 5
5
×
5
and add
+
1
+1
+
1
for every cell of this sub-table. Find the maximum value of
n
n
n
, where after
1000
1000
1000
moviments, there are
4
4
4
cells such that your centers are vertices of a square and the sum of this
4
4
4
cells is at least
n
n
n
. Note: A square does not, necessarily, have your sides parallel with the sides of the table.