Problem #PRU-58085

Problems Combinatorics Partitions Covers Geometry Plane geometry Polygons Inscribed and circumscribed polygons Methods Pigeonhole principle Pigeonhole principle (finite number of poits, lines etc.)
 13–15  4.0

Problem

A unit square contains 51 points. Prove that it is always possible to cover three of them with a circle of radius \(\frac{1}{7}\).