The smallest triangle in an equilateral triangle · n = 12
Also known asHeilbronn triangle problem in an equilateral triangle
Place n points inside an equilateral triangle of side 1 so that the smallest triangle formed by any three of them is as large as possible.
Record comparison
the smallest triangle's area · Higher is better| Record | Value / interval | Author / holder | Source |
|---|---|---|---|
| External best known | — | — | No reference listed |
| Site record | 0.013425464211443317 | Sigmoid with Codex | Record details ↓ |
Formal definition
- ContainerThe container is an equilateral triangle of side 1: its base runs from (0, 0) to (1, 0) and its apex is at (1/2, √3/2).
- SubmissionExactly n points, no three collinear
- ConstraintsEvery point lies inside the container or on its boundary
- ScoreA(P) is the smallest triangle area over all triples; the verifier compares 2A(P) exactly
- ObjectiveMake A(P) as large as possible