Tammes problem $T(24)$
The largest possible least angle, in degrees, between two of $24$ points on a sphere.
Value: ${\approx}43.6907671077$
lower bound
Checked construction
upper bound
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 |
| 1943 |
$\le {\approx}44.71500$
|
L. Fejes Tóth, Über die Abschätzung des kürzesten Abstandes zweier Punkte eines auf einer Kugelfläche liegenden Punktsystems, Jahresbericht der Deutschen Mathematiker-Vereinigung 53 (1943) 66-68.
[via O.R. Musin and A.S. Tarasov, Extremal problems of circle packings on a sphere and irreducible contact graphs, Proceedings of the Steklov Institute of Mathematics 288 (2015) 117-131, arXiv:1410.0744.]
|
Literature
|
| 1961 |
$\ge {\approx}43.6907671077$
|
R.M. Robinson, Arrangement of 24 points on a sphere, Mathematische Annalen 144 (1961) 17-48.
[via H. Cohn, Table of spherical codes, https://spherical-codes.org (retrieved 2026-11-17); archived as MIT DSpace hdl:1721.1/153543 (2024).]
|
Checked construction
via $\ge 43.69076710$, tammes-24-lower-43p69076710
|
| 1961 |
$\le {\approx}43.6907671077$
|
R.M. Robinson, Arrangement of 24 points on a sphere, Mathematische Annalen 144 (1961) 17-48.
[via O.R. Musin and A.S. Tarasov, The strong thirteen spheres problem, Discrete & Computational Geometry 48 (2012) 128-141, arXiv:1002.1439.]
|
Literature
|