combo-geo in 2000-gon (Ukraine 1998 Grade 9 P8)
Source:
June 5, 2021
combinatoricsgeometrycombinatorial geometry
Problem Statement
A convex -gon is given in the plane. Show that one can select points in the plane such that every triangle with the vertices at vertices of the -gon contains exactly one of the selected points in its interior (excluding the boundary).