Sum of radii in the unit circle · n = 44
Place n non-overlapping circles of independently chosen radii inside a disc of radius 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 |
|---|---|---|---|
| External best known | [6.12350, 6.12351] | See source attribution | Erich Friedman ↗ |
| Site record | 6.12350615 | zzzcy | Record details ↓ |
Matches the known best at published precision; this does not prove exact equality or optimality.
Formal definition
- ContainerThe closed disc of radius 1 centred at (1, 1); circles may touch the boundary
- SubmissionExactly n circles [x, y, r] with r > 0, each value having at most nine decimal places
- ConstraintsEvery circle lies inside the disc, (x − 1)² + (y − 1)² ≤ (1 − r)², and no two interiors intersect: the centre distance is at least the sum of the two radii. All checks are evaluated in exact integer arithmetic, 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