Problem

Source: Moldova TST 2024 P5

Tags: combinatorial geometry



Consider a natural number $n \ge 3$. A convex polygon with $n$ sides is entirely placed inside a square with side length 1. Prove that we can always find three vertices of this polygon, the triangle formed by which has area not greater than $\frac{8}{n^2}$.