MathDB
geometric combinatorics

Source:

January 31, 2016
geometrycombinatoricscombinatorial geometry

Problem Statement

Placing n∈Nn \in {\mathbb N} circles with radius 11 unitunit inside a square with side 100100 unitunit such that, whichever line segment with lenght 1010 unitunit intersect at least one circle. Prove that n≥416n \geq 416
Back to ProblemsView on AoPS