MathDB
Problems
Contests
International Contests
Nordic
2019 Nordic
4
4
Part of
2019 Nordic
Problems
(1)
an isosceles triangle
Source: Nordic 2019, P4
4/7/2019
Let
n
n
n
be an integer with
n
≥
3
n\geq 3
n
≥
3
and assume that
2
n
2n
2
n
vertices of a regular
(
4
n
+
1
)
−
(4n + 1)-
(
4
n
+
1
)
−
gon are coloured. Show that there must exist three of the coloured vertices forming an isosceles triangle.
graph theory
geometry