MathDB
Problems
Contests
International Contests
Rioplatense Mathematical Olympiad, Level 3
2015 Rioplatense Mathematical Olympiad, Level 3
2015 Rioplatense Mathematical Olympiad, Level 3
Part of
Rioplatense Mathematical Olympiad, Level 3
Subcontests
(6)
4
1
Hide problems
colorings in a 9x9 white board square, tiles moving inside the squares
You have a
9
×
9
9 \times 9
9
×
9
board with white squares. A tile can be moved from one square to another neighbor (tiles that share one side). If we paint some squares of black, we say that such coloration is good if there is a white square where we can place a chip that moving through white squares can return to the initial square having passed through at least
3
3
3
boxes, without passing the same square twice. Find the highest possible value of
k
k
k
such that any form of painting
k
k
k
squares of black are a good coloring.
6
1
Hide problems
3 equal circles or radius = inradius r, rioplatense line concurrency 2015 p6
Let
A
B
C
A B C
A
BC
be an acut-angles triangle of incenter
I
I
I
, circumcenter
O
O
O
and inradius
r
.
r.
r
.
Let
ω
\omega
ω
be the inscribed circle of the triangle
A
B
C
A B C
A
BC
.
A
1
A_1
A
1
is the point of
ω
\omega
ω
such that
A
I
A
1
O
A IA_1O
A
I
A
1
O
is a convex trapezoid of bases
A
O
A O
A
O
and
I
A
1
IA_1
I
A
1
. Let
ω
1
\omega_1
ω
1
be the circle of radius
r
r
r
which goes through
A
1
A_1
A
1
, tangent to the line
A
B
A B
A
B
and is different from
ω
\omega
ω
. Let
ω
2
\omega_2
ω
2
be the circle of radius
r
r
r
which goes through
A
1
A_1
A
1
, is tangent to the line
A
C
A C
A
C
and is different from
ω
\omega
ω
. Circumferences
ω
1
\omega_1
ω
1
and
ω
2
\omega_2
ω
2
they are cut at points
A
1
A_1
A
1
and
A
2
A_2
A
2
. Similarly are defined points
B
2
B_2
B
2
and
C
2
C_2
C
2
. Prove that the lines
A
A
2
,
B
B
2
A A_2, B B_2
A
A
2
,
B
B
2
and
C
C
2
CC2
CC
2
they are concurrent.
2
1
Hide problems
characteristic sequence of, numbers of elements in {a,b,c} that divide n
Let
a
,
b
,
c
a , b , c
a
,
b
,
c
positive integers, coprime. For each whole number
n
≥
1
n \ge 1
n
≥
1
, we denote by
s
(
n
)
s ( n )
s
(
n
)
the number of elements in the set
{
a
,
b
,
c
}
\{ a , b , c \}
{
a
,
b
,
c
}
that divide
n
n
n
. We consider
k
1
<
k
2
<
k
3
<
.
.
.
k_1< k_2< k_3<...
k
1
<
k
2
<
k
3
<
...
.the sequence of all positive integers that are divisible by some element of
{
a
,
b
,
c
}
\{ a , b , c \}
{
a
,
b
,
c
}
. Finally we define the characteristic sequence of
(
a
,
b
,
c
)
( a , b , c )
(
a
,
b
,
c
)
like the succession
s
(
k
1
)
,
s
(
k
2
)
,
s
(
k
3
)
,
.
.
.
.
s ( k_1) , s ( k_2) , s ( k_3) , ....
s
(
k
1
)
,
s
(
k
2
)
,
s
(
k
3
)
,
....
. Prove that if the characteristic sequences of
(
a
,
b
,
c
)
( a , b , c )
(
a
,
b
,
c
)
and
(
a
′
,
b
′
,
c
′
)
( a', b', c')
(
a
′
,
b
′
,
c
′
)
are equal, then
a
=
a
′
,
b
=
b
′
a = a', b = b'
a
=
a
′
,
b
=
b
′
and
c
=
c
′
c=c'
c
=
c
′
1
1
Hide problems
angles equal 180
Let
A
B
C
ABC
A
BC
be a triangle and
P
P
P
a point on the side
B
C
BC
BC
. Let
S
1
S_1
S
1
be the circumference with center
B
B
B
and radius
B
P
BP
BP
that cuts the side
A
B
AB
A
B
at
D
D
D
such that
D
D
D
lies between
A
A
A
and
B
B
B
. Let
S
2
S_2
S
2
be the circumference with center
C
C
C
and radius
C
P
CP
CP
that cuts the side
A
C
AC
A
C
at
E
E
E
such that
E
E
E
lies between
A
A
A
and
C
C
C
. Line
A
P
AP
A
P
cuts
S
1
S_1
S
1
and
S
2
S_2
S
2
at
X
X
X
and
Y
Y
Y
different from
P
P
P
, respectively. We call
T
T
T
the point of intersection of
D
X
DX
D
X
and
E
Y
EY
E
Y
. Prove that
∠
B
A
C
+
2
∠
D
T
E
=
180
\angle BAC+ 2 \angle DTE=180
∠
B
A
C
+
2∠
D
TE
=
180
5
1
Hide problems
find all possible values
For a positive integer number
n
n
n
we denote
d
(
n
)
d(n)
d
(
n
)
as the greatest common divisor of the binomial coefficients
(
n
+
1
n
)
,
(
n
+
2
n
)
,
.
.
.
,
(
2
n
n
)
\dbinom{n+1}{n} , \dbinom{n+2}{n} ,..., \dbinom{2n}{n}
(
n
n
+
1
)
,
(
n
n
+
2
)
,
...
,
(
n
2
n
)
. Find all possible values of
d
(
n
)
d(n)
d
(
n
)
3
1
Hide problems
infinite or not?
We say an integer number
n
≥
1
n \ge 1
n
≥
1
is conservative, if the smallest prime divisor of
(
n
!
)
n
+
1
(n!)^n+1
(
n
!
)
n
+
1
is at most
n
+
2015
n+2015
n
+
2015
. Decide if the number of conservative numbers is infinite or not.