Problem #PRU-58089

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

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?