Problem

Source: ELMO 2009, Problem 4

Tags: algorithm, analytic geometry, combinatorics



Let $n$ be a positive integer. Given $n^2$ points in a unit square, prove that there exists a broken line of length $2n + 1$ that passes through all the points. Allen Yuan