Sum of radii in the equilateral triangle · n = 15
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.
Record comparison
the sum of the radii · Higher is better| Record | Value / interval | Author / holder | Source |
|---|---|---|---|
| Proven optimum | ≈ 1.3084322264 | zzzcy #308 | MinMax Arena ↗ |
| Site record | 1.308432222 | zzzcy | Record details ↓ |
The continuous optimum is proved, so competition submissions are closed. Historical records and contribution points are retained. Because finite-decimal coordinates cannot attain this value exactly, the current certificate is not claimed optimal on the nine-decimal grid.
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