Sum of radii in the equilateral triangle
Place n non-overlapping circles of independently chosen radii inside an equilateral triangle of side 1 so as to maximise the sum of their radii.
Formal definition
- ContainerThe closed equilateral triangle with vertices (0, 0), (1, 0), and (1/2, √3/2); circles may touch the sides
- SubmissionExactly n circles [x, y, r] with r > 0, each value having at most nine decimal places
- ConstraintsEvery circle lies inside the triangle: y ≥ r, √3·x − y ≥ 2r, and √3·(1 − x) − y ≥ 2r; no two interiors intersect: the centre distance is at least the sum of the two radii. Slanted-side constraints are evaluated via exact integer-square comparisons, with tangency allowed
- ScoreThe sum of the radii, computed as an exact integer sum and displayed to nine decimal places; larger is better
- ObjectiveMaximise the sum of the radii over all valid arrangements
Getting a feel for it
Central disc and 60° corner cascades
The three 60° corners of an equilateral triangle naturally accommodate geometric cascades of successively smaller tangent circles, while additional small circles can be tucked into the curvilinear pockets along the three sides. Consequently, multi-scale tangent packings achieve a much larger radius sum than uniform triangular lattices.
Literature records and proven optima
Erich Friedman's maximum-total-perimeter table covers n ≤ 30: twenty-six entries come from David W. Cantrell's 2011 search (reported to three decimal places), while n = 27, 29, and 30 were contributed by Haowei Lin and Jonathan Viquerat in 2026. In October 2026, a computer-assisted proof by zzzcy (independently verified by this catalogue) established optimality for n = 1–11 and n = 15, whose certificates attain the maximum possible nine-decimal score. Remaining entries up to n = 30 are reconstructed from the published diagrams and verified exactly (with n = 29 citing the literature value only), while n = 31–50 extend beyond the published table.
SourceCurrent best solutions by n
Each parameter n is an independently scored sub-problem. Select any card to inspect the current record construction or submit a stronger solution.
Discussion (3) ↓Data and citation
All sub-problems in this family — authoritative scores, proof status, coordinates, and sources — are published at the stable URL below under CC BY 4.0. Because scores update as records fall, please cite the file's generatedAt timestamp.
GET https://minmaxarena.com/data/circles-in-triangle-radii.json
Cite the frozen 2026-10 edition: live records change, whereas a frozen edition stays fixed and reproducible.
GET https://minmaxarena.com/data/editions/2026-10/circles-in-triangle-radii.json
BibTeX (click to copy)
@misc{minmaxarena-circles-in-triangle-radii-2026-10,
title = {{Sum of radii in the equilateral triangle} (P93)},
author = {{MinMax Arena}},
year = {2026},
note = {Machine-verified records, 2026-10 edition},
url = {https://minmaxarena.com/data/editions/2026-10/circles-in-triangle-radii.json},
license = {CC BY 4.0}
}Discussion
Discuss strategies, share construction methods, or ask questions. Any signed-in user can post under their public byline and unique #UID. New posts appear after moderation.
Grouped by player and sub-problem, showing the latest note first. Earlier versions and replies are preserved; click any note to read or reply. Notes can be published alongside record-breaking submissions.