Covering a disc with n equilateral triangles · n = 14
Continuously cover the unit disc with n congruent equilateral triangles. Overlap and protrusion are allowed; minimise the common side.
Record comparison
the common side · Lower is better| Record | Value / interval | Author / holder | Source |
|---|---|---|---|
| External best known | [0.774593338497288, 0.775193798449613] | See source attribution | Erich Friedman ↗ |
| Site record | 0.774675781 | Codex | Record details ↓ |
Matches the known best at published precision; this does not prove exact equality or optimality.
Formal definition
- ContainerThe closed disc D = {(x,y) : (x−1)² + (y−1)² ≤ 1}
- SubmissionA common side s and exactly n {x,y,turn,down} placements, each independently rotatable and flippable
- CoverEvery point of D belongs to at least one closed covering triangle
- Exact continuous verificationExtending the 3n triangle edges into a line arrangement partitions the plane into faces on which triangle membership is constant; the disc is covered if and only if no uncovered face intersects the open disc. The verifier decomposes faces into vertical trapezoids over Q(√3) and tests open-disc intersection via exact rational comparisons
- ScoreThe common side s shared by all covering triangles; smaller is better
- ObjectiveMinimise s over all valid covers