Heilbronn triangle problem in a square $H(5)$
The largest possible area of the smallest triangle formed by three of $5$ points in a unit square.
Value: $\frac{\sqrt{3}}{9}$
(≈0.1924501)
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 |
| 1972-05 |
$\ge \frac{3-\sqrt{5}}{4}$
(≈0.190983)
|
M. Goldberg, Maximizing the smallest triangle made by N points in a square, Mathematics Magazine 45(3) (1972) 135-144.
|
Checked construction
via $\ge 0.1924500897$, heilbronn-square-5-lower-0p1924500897
|
| 1991 |
$\ge \frac{\sqrt{3}}{9}$
(≈0.1924501)
|
L. Yang, J. Zhang and Z. Zeng, Heilbronn problem for five points, International Centre for Theoretical Physics, Trieste, preprint IC/91/252 (1991).
[via T. Stead, The Heilbronn problem: square, tables of the best known configurations of n points in the unit square for n = 3 to 100, with their record histories (linked from Erich Friedman's Packing Center), retrieved 2026-11-21.]
|
Checked construction
via $\ge 0.1924500897$, heilbronn-square-5-lower-0p1924500897
|
| 1991 |
$\le \frac{\sqrt{3}}{9}$
(≈0.1924501)
|
L. Yang, J. Zhang and Z. Zeng, Heilbronn problem for five points, International Centre for Theoretical Physics, Trieste, preprint IC/91/252 (1991).
[via T. Stead, The Heilbronn problem: square, tables of the best known configurations of n points in the unit square for n = 3 to 100, with their record histories (linked from Erich Friedman's Packing Center), retrieved 2026-11-21.]
|
Literature
|