MathDB
Problems
Contests
National and Regional Contests
Brazil Contests
Brazil National Olympiad
2016 Brazil National Olympiad
2016 Brazil National Olympiad
Part of
Brazil National Olympiad
Subcontests
(6)
4
1
Hide problems
Integers without distances 1,2,6 between them
What is the greatest number of positive integers lesser than or equal to 2016 we can choose such that it doesn't have two of them differing by 1,2, or 6?
5
1
Hide problems
Reiterating a polynomial
Consider the second-degree polynomial
P
(
x
)
=
4
x
2
+
12
x
−
3015
P(x) = 4x^2+12x-3015
P
(
x
)
=
4
x
2
+
12
x
−
3015
. Define the sequence of polynomials
P
1
(
x
)
=
P
(
x
)
2016
P_1(x)=\frac{P(x)}{2016}
P
1
(
x
)
=
2016
P
(
x
)
and
P
n
+
1
(
x
)
=
P
(
P
n
(
x
)
)
2016
P_{n+1}(x)=\frac{P(P_n(x))}{2016}
P
n
+
1
(
x
)
=
2016
P
(
P
n
(
x
))
for every integer
n
≥
1
n \geq 1
n
≥
1
.[list='a'] [*]Show that exists a real number
r
r
r
such that
P
n
(
r
)
<
0
P_n(r) < 0
P
n
(
r
)
<
0
for every positive integer
n
n
n
. [*]Find how many integers
m
m
m
are such that
P
n
(
m
)
<
0
P_n(m)<0
P
n
(
m
)
<
0
for infinite positive integers
n
n
n
.
6
1
Hide problems
A convex, non-cyclical quadrilateral, and two cyclical ones
Lei it
A
B
C
D
ABCD
A
BC
D
be a non-cyclical, convex quadrilateral, with no parallel sides. The lines
A
B
AB
A
B
and
C
D
CD
C
D
meet in
E
E
E
. Let it
M
≠
E
M \not= E
M
=
E
be the intersection of circumcircles of
A
D
E
ADE
A
D
E
and
B
C
E
BCE
BCE
. The internal angle bisectors of
A
B
C
D
ABCD
A
BC
D
form an convex, cyclical quadrilateral with circumcenter
I
I
I
. The external angle bisectors of
A
B
C
D
ABCD
A
BC
D
form an convex, cyclical quadrilateral with circumcenter
J
J
J
.Show that
I
,
J
,
M
I,J,M
I
,
J
,
M
are colinear.
3
1
Hide problems
A binary game - change streaks of digits until it ends
Let it
k
k
k
be a fixed positive integer. Alberto and Beralto play the following game: Given an initial number
N
0
N_0
N
0
and starting with Alberto, they alternately do the following operation: change the number
n
n
n
for a number
m
m
m
such that
m
<
n
m < n
m
<
n
and
m
m
m
and
n
n
n
differ, in its base-2 representation, in exactly
l
l
l
consecutive digits for some
l
l
l
such that
1
≤
l
≤
k
1 \leq l \leq k
1
≤
l
≤
k
. If someone can't play, he loses.We say a non-negative integer
t
t
t
is a winner number when the gamer who receives the number
t
t
t
has a winning strategy, that is, he can choose the next numbers in order to guarrantee his own victory, regardless the options of the other player. Else, we call it loser.Prove that, for every positive integer
N
N
N
, the total of non-negative loser integers lesser than
2
N
2^N
2
N
is
2
N
−
⌊
l
o
g
(
m
i
n
{
N
,
k
}
)
l
o
g
2
⌋
2^{N-\lfloor \frac{log(min\{N,k\})}{log 2} \rfloor}
2
N
−
⌊
l
o
g
2
l
o
g
(
min
{
N
,
k
})
⌋
2
1
Hide problems
At least One pair with square of distance multiple of 2016
Find the smallest number
n
n
n
such that any set of
n
n
n
ponts in a Cartesian plan, all of them with integer coordinates, contains two poitns such that the square of its mutual distance is a multiple of
2016
2016
2016
.
1
1
Hide problems
Three points aligned imply an isosceles triangle
Let
A
B
C
ABC
A
BC
be a triangle.
r
r
r
and
s
s
s
are the angle bisectors of
∠
A
B
C
\angle ABC
∠
A
BC
and
∠
B
C
A
\angle BCA
∠
BC
A
, respectively. The points
E
E
E
in
r
r
r
and
D
D
D
in
s
s
s
are such that
A
D
∥
B
E
AD \| BE
A
D
∥
BE
and
A
E
∥
C
D
AE \| CD
A
E
∥
C
D
. The lines
B
D
BD
B
D
and
C
E
CE
CE
cut each other at
F
F
F
.
I
I
I
is the incenter of
A
B
C
ABC
A
BC
.Show that if
A
,
F
,
I
A,F,I
A
,
F
,
I
are collinear, then
A
B
=
A
C
AB=AC
A
B
=
A
C
.