Problem #PRU-58089

Problems Geometry Plane geometry Convex and non-convex figures Convex polygons Methods Pigeonhole principle Pigeonhole principle (finite number of poits, lines etc.)
 12–15  4.0

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?