MathDB
Problems
Contests
National and Regional Contests
Chile Contests
The Golden Number Mathematics Tournament
TNO 2023
TNO 2023
Part of
The Golden Number Mathematics Tournament
Subcontests
(6)
4
1
Hide problems
Road Networks and Reachability
In a country, there are
n
n
n
cities. Each pair of cities is connected either by a paved road or a dirt road. It is known that there exists a pair of cities such that it is impossible to travel between them using only paved roads. Show that, in this case, it is possible to travel between any two cities using only dirt roads.
5
1
Hide problems
Integer Triples with Equations
Find all triples of integers
(
x
,
y
,
z
)
(x, y, z)
(
x
,
y
,
z
)
such that
x
−
y
z
=
11
x - yz = 11
x
−
yz
=
11
x
z
+
y
=
13
xz + y = 13
x
z
+
y
=
13
6
1
Hide problems
Dense Colors in a Circle
The points inside a circle
Γ
\Gamma
Γ
are painted with
n
≥
1
n \geq 1
n
≥
1
colors. A color is said to be dense in a circle
Ω
\Omega
Ω
if every circle contained within
Ω
\Omega
Ω
has points of that color in its interior. Prove that there exists at least one color that is dense in some circle contained within
Γ
\Gamma
Γ
.
3
1
Hide problems
American geo in chile :o
Let
△
A
B
C
\triangle ABC
△
A
BC
be an acute triangle with orthocenter
H
H
H
, and let
M
M
M
be the midpoint of
B
C
BC
BC
. Let
P
P
P
be the foot of the perpendicular from
H
H
H
to
A
M
AM
A
M
. Prove that
A
M
⋅
M
P
=
B
M
2
AM \cdot MP = BM^2
A
M
⋅
MP
=
B
M
2
.
2
1
Hide problems
A well know theorem
Find all integers
n
>
1
n > 1
n
>
1
such that all prime divisors of
n
6
−
1
n^6 - 1
n
6
−
1
divide
(
n
2
−
1
)
(
n
3
−
1
)
(n^2 - 1)(n^3 - 1)
(
n
2
−
1
)
(
n
3
−
1
)
.
1
1
Hide problems
Bruno again....
Let
n
≥
4
n \geq 4
n
≥
4
be an integer. Show that at a party of
n
n
n
people, it is possible for each person to have greeted exactly three other people if and only if
n
n
n
is even.