Packing $12$ unit circles in a square
The side of the smallest square into which $12$ unit circles (of radius 1) can be packed.
Value: $2+\frac{15\sqrt{34}}{17}$ (≈7.144958) 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 2+\frac{15\sqrt{34}}{17}$ (≈7.144958) |
Reference unknown
[via R. Peikert, Dichteste Packungen von gleichen Kreisen in einem Quadrat, Elemente der Mathematik 49 (1994) 16-26.] |
Checked construction
Certificate circle-in-square-12-upper-2-15sqrt34over17, submitted by daniel-munro, 2026-11-15 |
| 1991-09 | $\ge 2+\frac{15\sqrt{34}}{17}$ (≈7.144958) |
R. Peikert, D. Würtz, M. Monagan, C. de Groot, Packing circles in a square: a review and new results, in P. Kall (ed.), System Modelling and Optimization (Proc. 15th IFIP Conference, Zürich, 1991), Lecture Notes in Control and Information Sciences 180, Springer (1992) 45-54.
[via R. Peikert, Dichteste Packungen von gleichen Kreisen in einem Quadrat, Elemente der Mathematik 49 (1994) 16-26.] |
Literature |