Sum of radii in the unit circle · n = 23
Place n non-overlapping circles inside a circle of radius 1, each with its own radius, making the sum of the radii as large as possible.
Record comparison
the sum of the radii · Higher is better| Record | Value / interval | Author / holder | Source |
|---|---|---|---|
| External best known | [4.372, 4.373] | See source attribution | Erich Friedman ↗ |
| Site record | No player record yet | — | — |
Formal definition
- ContainerThe closed disc of radius 1 centred at (1, 1); a circle may touch the boundary
- SubmissionExactly n circles, each [x, y, r] with r > 0, every number to at most nine decimals
- ConstraintsEvery circle lies inside the disc, (x − 1)² + (y − 1)² ≤ (1 − r)², and no two interiors meet: the distance between centres is at least the sum of the radii. All checked exactly in integers; touching is allowed
- ScoreThe sum of the radii, an exact integer sum shown to nine decimals; larger is better
- ObjectiveMaximise the sum of the radii over every legal arrangement