Problem #PRU-58089

Problemas Geometría Geometría plana Figuras convexas y no convexas Polígonos convexos Métodos Principio del palomar Principio del palomar (número finito de puntos, líneas, etc.)

Problem

What is the minimum number of points necessary to mark inside a convex \(n\)-gon, so that at least one marked point always lies inside any triangle whose vertices are the vertices of the polygon?