MathDB
Problems
Contests
National and Regional Contests
Argentina Contests
Argentina National Olympiad
2023 Argentina National Olympiad
2023 Argentina National Olympiad
Part of
Argentina National Olympiad
Subcontests
(6)
2
1
Hide problems
all prime factors of 2^n-1 are less than or equal to 7
Find all positive integers
n
n
n
such that all prime factors of
2
n
−
1
2^n-1
2
n
−
1
are less than or equal to
7
7
7
.
6
1
Hide problems
AN INTRESTING PING PONG CONTEST
There´s a ping pong tournament with
n
≥
3
n\geq 3
n
≥
3
participants that we´ll call
1
,
2
,
…
n
1, 2, \dots n
1
,
2
,
…
n
. The tournament rules are the following ones: at the start, all the players form a line, ordered from
1
1
1
to
n
n
n
. Players
1
1
1
and
2
2
2
play the first match. The winner is at the beginning of the line and the loser is placed behind the last person in the line.In the next play, the two who at that moment are the first two in line face each other, the winner is first in line and the loser goes to the end of the line, just behind the last loser. And so on. After
N
N
N
matches, the tournament ends.Player number
1
1
1
won
a
1
a_1
a
1
matches, player number
2
2
2
won
a
2
a_2
a
2
, and so on till player
n
n
n
, that has won
a
n
a_n
a
n
matches (it is trivial that
a
1
+
a
2
+
⋯
+
a
n
=
N
)
a_1+a_2+\dots+a_n=N)
a
1
+
a
2
+
⋯
+
a
n
=
N
)
.Determine how many games each player has lost, based on
a
1
,
a
2
,
…
,
a
n
a_1, a_2, \dots , a_n
a
1
,
a
2
,
…
,
a
n
5
1
Hide problems
ARGENTINA MO 2023 National Level 3
Let
n
n
n
be a positive integer. Beto writes a list of
n
n
n
non-negative integers on the board. Then he performs a succession of moves (two steps) of the following type: First for each
i
=
1
,
2
,
.
.
.
,
n
i=1,2,...,n
i
=
1
,
2
,
...
,
n
, he counts how many numbers on the board are less than or equal to
i
i
i
. Let
a
i
a_i
a
i
be the number obtained for each
i
=
1
,
2
,
.
.
.
,
n
i=1,2,...,n
i
=
1
,
2
,
...
,
n
. Next, he erases all the numbers from the board and writes the numbers
a
1
,
a
2
,
.
.
.
,
a
n
a_1,a_2,...,a_n
a
1
,
a
2
,
...
,
a
n
. For example, if
n
=
5
n=5
n
=
5
and the initial numbers on the board are
0
,
7
,
2
,
6
,
2
0,7,2,6,2
0
,
7
,
2
,
6
,
2
, after the first move, the numbers on the board will bec
1
,
3
,
3
,
3
,
3
1,3,3,3,3
1
,
3
,
3
,
3
,
3
;after the second move they will be
1
,
1
,
5
,
5
,
5
1,1,5,5,5
1
,
1
,
5
,
5
,
5
, and so on.
a
)
a)
a
)
Show that, for every
n
n
n
and every initial configuration, there will come a time after which the numbers will no longer be modified when using this move.
b
)
b)
b
)
Find (as a function of
n
n
n
) the minimum value of
k
k
k
such that, for any initial configuration, the moves made from move number
k
k
k
will not change the numbers on the board.
4
1
Hide problems
A pretty easy factorization
Lets say that a positive integer is
g
o
o
d
good
g
oo
d
if its equal to the the subtraction of two positive integer cubes. For example:
7
7
7
is a
g
o
o
d
good
g
oo
d
prime because
2
3
−
1
3
=
7
2^3-1^3=7
2
3
−
1
3
=
7
.Determine how much the last digit of a
g
o
o
d
good
g
oo
d
prime may be worth. Give all the possibilities.
3
1
Hide problems
ARGENTINA MO National Level 3 P3
Let
A
B
C
ABC
A
BC
be a triangle and
M
M
M
be the middle point of
B
C
BC
BC
. Let
Ω
\Omega
Ω
be the circumference such as
A
,
B
,
C
∈
Ω
A,B,C \in \Omega
A
,
B
,
C
∈
Ω
. Let
P
P
P
be the intersection of
Ω
\Omega
Ω
and
A
M
AM
A
M
.
A
F
AF
A
F
is a hight of the triangle, with
F
∈
B
C
F\in BC
F
∈
BC
, and
H
H
H
the orthocenter.Additionally the intersections of
M
H
MH
M
H
and
P
F
PF
PF
with
Ω
\Omega
Ω
are
K
K
K
and
T
T
T
respectibly. Demonstrate that the circumscribed circumference of the traingle
K
T
F
KTF
K
TF
is tangent with
B
C
BC
BC
.
1
1
Hide problems
ARGENTINA MO 2023 Level 3 P1
Let
n
n
n
be a positive with
n
≥
3
n\geq 3
n
≥
3
. Consider a board of
n
×
n
n \times n
n
×
n
boxes. In each step taken the colors of the
5
5
5
boxes that make up the figure bellow change color (black boxes change to white and white boxes change to black) The figure can be rotated
90
°
,
180
°
90°, 180°
90°
,
180°
or
270
°
270°
270°
. Firstly, all the boxes are white.Determine for what values of
n
n
n
it can be achieved, through a series of steps, that all the squares on the board are black.