Problem

Source:

Tags: combinatorics, geometry, combinatorial geometry



A convex $2000$-gon is given in the plane. Show that one can select $1998$ points in the plane such that every triangle with the vertices at vertices of the $2000$-gon contains exactly one of the selected points in its interior (excluding the boundary).