Covering a disk with $1$ disks

The smallest radius such that $1$ disks of that radius can cover the unit disk, of radius 1.

Value: $1$ Lean proof

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 $\ge 1$ Trivial or easy according to the secondary source.
[via Circles Covering Circles, Erich Friedman]
Lean proof
Certificate disk-covering-1-lower-1, submitted by daniel-munro, 2026-11-15
undated $\le 1$ Trivial or easy according to the secondary source.
[via Circles Covering Circles, Erich Friedman]
Lean proof
Certificate disk-covering-1-upper-1, submitted by daniel-munro, 2026-11-15