Packing $10$ unit circles in a square
The side of the smallest square into which $10$ unit circles (of radius 1) can be packed.
Value: ${\approx}6.747441523$ Literature
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 |
|---|---|---|---|
| 1979 | $\le {\approx}6.747441523$ |
K. Schlüter, Kreispackung in Quadraten, Elemente der Mathematik 34 (1979) 12-14.
[via R. Peikert, Dichteste Packungen von gleichen Kreisen in einem Quadrat, Elemente der Mathematik 49 (1994) 16-26.] |
Literature |
| 1990-08 | $\ge {\approx}6.747441523$ |
C. de Groot, R. Peikert, D. Würtz, The optimal packing of ten equal circles in a square, IPS Research Report No. 90-12, ETH Zürich, 1990.
[via R. Peikert, Dichteste Packungen von gleichen Kreisen in einem Quadrat, Elemente der Mathematik 49 (1994) 16-26.] |
Literature |
Other certificates
Certificates that aren't the best evidence for any bound above: other certificates are stronger evidence for the same bounds, or they prove only bounds weaker than any recorded.
- $\le 6.747443$: circle-in-square-10-upper-6p747443, submitted by daniel-munro, 2026-11-15 Weaker than recorded