Packing $25$ unit circles in a square

Packing 25 unit circles in a square

The side of the smallest square into which $25$ unit circles (of radius 1) can be packed.

Value: $10$ lower bound Literature upper bound Checked construction

History

Each bound that improved on the earlier ones, with the record of its discovery and its best evidence. A bound is discovered in the literature, or by a certificate submitted here. Its best evidence is a certificate checked here, if there is one at least as strong: a formal proof in Lean (Lean proof) or an explicit construction checked by a program (Checked construction). Otherwise it's an Attested certificate, which someone else checked with a published checker, or the Literature. Submit a certificate.

Date Bound Discovery Best evidence
undated $\le 10$ Trivial or easy according to the secondary source.
[via R. L. Graham, B. D. Lubachevsky, Repeated patterns of dense packings of equal disks in a square, Electronic Journal of Combinatorics 3 (1996) #R16, arXiv:math/0406394.]
Checked construction
Certificate circle-in-square-25-upper-10, submitted by daniel-munro, 2026-11-15
1987 $\ge 10$ G. Wengerodt, Die dichteste Packung von 25 Kreisen in einem Quadrat, Annales Universitatis Scientiarum Budapestinensis de Rolando Eötvös Nominatae, Sectio Mathematica 30 (1987) 3-15.
[via P. G. Szabó, E. Specht, Packing up to 200 equal circles in a square, in A. Törn, J. Žilinskas (eds.), Models and Algorithms for Global Optimization, Springer (2007) 141-156.]
Literature