MathDB
Problems
Contests
National and Regional Contests
Argentina Contests
Argentina Cono Sur TST
2024 Argentina Cono Sur TST
2024 Argentina Cono Sur TST
Part of
Argentina Cono Sur TST
Subcontests
(6)
Problem 6
1
Hide problems
Factorials and perfect powers
Find all pairs of positive integers
(
n
,
k
)
(n, k)
(
n
,
k
)
that satisfy the equation
n
!
+
n
=
n
k
n!+n=n^k
n
!
+
n
=
n
k
Problem 5
1
Hide problems
Knights attacking each other
In chess, a knight placed on a chess board can move by jumping to an adjacent square in one direction (up, down, left, or right) then jumping to the next two squares in a perpendicular direction. We then say that a square in a chess board can be attacked by a knight if the knight can end up on that square after a move. Thus, depending on where a knight is placed, it can attack as many as eight squares, or maybe even less.In a
10
×
10
10 \times 10
10
×
10
chess board, what is the maximum number of knights that can be placed such that each square on the board can be attacked by at most one knight?
Problem 4
1
Hide problems
Minimum value of fraction with three variables
Find the least possible value of
(
x
2
+
1
)
(
4
y
2
+
1
)
(
9
z
2
+
1
)
6
x
y
z
\dfrac{(x^2+1)(4y^2+1)(9z^2+1)}{6xyz}
6
x
yz
(
x
2
+
1
)
(
4
y
2
+
1
)
(
9
z
2
+
1
)
if
x
x
x
,
y
y
y
,
z
z
z
are not necessarily distinct positive real numbers.
Problem 3
1
Hide problems
Circumcenter lies on circumcircle.
Let
A
B
C
ABC
A
BC
be an acute triangle. The point
B
′
B'
B
′
of the line
C
A
CA
C
A
is such that
A
A
A
,
C
C
C
,
B
′
B'
B
′
are in that order on the line and
B
′
C
=
A
B
B'C=AB
B
′
C
=
A
B
; the point
C
′
C'
C
′
of the line
A
B
AB
A
B
is such that
A
A
A
,
B
B
B
,
C
′
C'
C
′
are in that order on the line and
C
′
B
=
A
C
C'B=AC
C
′
B
=
A
C
. Show that the circumcenter of triangle
A
B
′
C
′
AB'C'
A
B
′
C
′
belongs to the circumcircle of triangle
A
B
C
ABC
A
BC
.
Problem 2
1
Hide problems
Divisibility on 101 integers
There are
101
101
101
positive integers
a
1
,
a
2
,
…
,
a
101
a_1, a_2, \ldots, a_{101}
a
1
,
a
2
,
…
,
a
101
such that for every index
i
i
i
, with
1
≤
i
≤
101
1 \leq i \leq 101
1
≤
i
≤
101
,
a
i
+
1
a_i+1
a
i
+
1
is a multiple of
a
i
+
1
a_{i+1}
a
i
+
1
. Find the greatest possible value of the largest of the
101
101
101
numbers.
Problem 1
1
Hide problems
Two players alternately colour two cells from the same row or column
Two players take turns playing on a
3
×
1001
3\times1001
3
×
1001
board whose squares are initially all white. Each player, in his turn, paints two squares located in the same row or column black, not necessarily adjacent. The player who cannot make his move loses the game. Determine which of the two players has a strategy that allows them to win, no matter how well his opponent plays.