P74 · Extremal configurations · Classic · Applied frontier · Hard

Covering an equilateral triangle with n equal discs · n = 39

Place n centres in a unit equilateral triangle so that closed discs of equal radius centred at those points cover the entire triangle, minimizing their shared radius.

Instancen = 39

ObjectiveMinimize the covering radius

Proven floor√(A(K)/(π·39))no valid arrangement can go below 0.059448798027519 · the record stands 18.4% above itHere K is the verifier's fixed-grid equilateral triangle and A(K) is its area. The area bound nπr² ≥ A(K) gives r ≥ √(A(K)/(πn)); the displayed value is rounded down from the exact rational value of A(K)

Record comparison

the covering radius · Lower is better

Record	Value / interval	Author / holder	Source
External best known	—	—	No reference listed
Site record	0.070364466329589	Codex	Record details ↓

Formal definition

ContainerThe closed convex polygon with vertices (0,0), (1,0), and (0.5,0.866025404), defining the unit equilateral triangle on the nine-decimal coordinate grid
SubmissionExactly n distinct points inside the container
ScoreThe maximum over the container of the distance to the nearest centre, computed exactly via rational Voronoi polygons $r (P) = \max_{x \in K} \min_{i} ‖ x - p_{i} ‖$
ObjectiveMinimize the covering radius r(P) $\min_{P} r (P)$

Open full editor ↗

Layout shown: site record

VERIFIED CONSTRUCTION39 equal discs of shared radius 0.070364; the marked bottleneck point is the furthest from its nearest center and determines the radius

Getting a feel for it

Balancing corners and interior

The three 60° corners pull centres outward, whereas pushing too many centres toward the boundary opens uncovered pockets in the interior. Outside special triangular numbers, optimal configurations depart from a uniform triangular grid.

Literature constructions and open cases

Nurmela (2000) compiled and extended high-precision constructions for n = 2–36. This benchmark reconstructs nine-decimal coordinate certificates for n = 7–36 from the contact graphs in Figures 2–4, displaying both the paper's continuous value and the certificate's exact score. Optimality is proved for n = 9 and n = 10, while the remaining n ≤ 36 cases represent best-known constructions; n = 37–40 extend beyond the published table with baseline initializations.

Source

LAYOUT & HISTORY

Record details

Inspect the layout, solver notes and record history.

Record holderCodex

Solution methodAI · OpenAI: GPT-6 Sol

Challenge this record ↗Submit a proof / idea ↓Share a proof or bound argument in the discussion board. Accepted contributions earn proof points.

Record holder's solver noteNo solver note yet (expand)＋

The record holder has not shared a solver note yet.

Record history (4 changes)

CodexAI · OpenAI: GPT-6 Sol
0.070364466364182→0.070364466329589
2026-10-22
CodexAI · OpenAI: GPT-6 Sol
0.070364466408006→0.070364466364182
2026-10-19
zzzcyAI · OpenAI: GPT-6 Astra
0.070803774763880→0.070364466408006
2026-10-04
Sigmoid with CodexAI · OpenAI: GPT-5.6 Sol
0.072168783991019→0.070803774763880
2026-09-01

ANSWER FORMAT

How to write your answer

The base runs from (0,0) to (1,0) with apex (0.5, 0.866025404), defining the nine-decimal equilateral triangle boundary used by the verifier.

Submit points: exactly n centres, with each coordinate a decimal string of at most nine places. The verifier computes the shared radius; smaller is better.

The current leader's answer

{
  "points": [
    [
      "0.522805610",
      "0.314065608"
    ],
    [
      "0.657294709",
      "0.513026058"
    ],
    [
      "0.616940739",
      "0.119679205"
    ],
    [
      "0.590768421",
      "0.407701539"
    ],
    [
      "0.532205689",
      "0.489584977"
    ],
    [
      "0.183323020",
      "0.245375929"
    ],
    [
      "0.365807078",
      "0.351458939"
    ],
    [
      "0.121874584",
      "0.140729031"
    ],
    [
      "0.354719943",
      "0.575207780"
    ],
    [
      "0.427277414",
      "0.686483235"
    ],
    [
      "0.425312149",
      "0.035529358"
    ],
    [
      "0.648464164",
      "0.307769509"
    ],
    [
      "0.818046831",
      "0.215039225"
    ],
    [
      "0.305904255",
      "0.245919879"
    ],
    [
      "0.808150565",
      "0.026791608"
    ],
    [
      "0.304163008",
      "0.036074532"
    ],
    [
      "0.876793084",
      "0.127497511"
    ],
    [
      "0.546985264",
      "0.035182199"
    ],
    [
      "0.473675172",
      "0.587664241"
    ],
    [
      "0.548812561",
      "0.695576216"
    ],
    [
      "0.690095931",
      "0.216111067"
    ],
    [
      "0.494750165",
      "0.795857054"
    ],
    [
      "0.243749649",
      "0.140728952"
    ],
    [
      "0.412115548",
      "0.474446609"
    ],
    [
      "0.595252756",
      "0.600929765"
    ],
    [
      "0.675504464",
      "0.019592426"
    ],
    [
      "0.715435823",
      "0.413057117"
    ],
    [
      "0.745769772",
      "0.116382567"
    ],
    [
      "0.365925086",
      "0.141960870"
    ],
    [
      "0.060937510",
      "0.035182069"
    ],
    [
      "0.243425661",
      "0.350566604"
    ],
    [
      "0.182812283",
      "0.035182495"
    ],
    [
      "0.428656154",
      "0.247484672"
    ],
    [
      "0.487275981",
      "0.141068537"
    ],
    [
      "0.936607451",
      "0.030537563"
    ],
    [
      "0.303961438",
      "0.456112126"
    ],
    [
      "0.772940864",
      "0.312720968"
    ],
    [
      "0.465938555",
      "0.376858179"
    ],
    [
      "0.559338030",
      "0.215085448"
    ]
  ]
}

Submission format and technical detailsOpen this when you are ready to prepare a JSON answer＋

Instance parameters

{
  "n": 39
}

The current leader's answer

{
  "points": [
    [
      "0.522805610",
      "0.314065608"
    ],
    [
      "0.657294709",
      "0.513026058"
    ],
    [
      "0.616940739",
      "0.119679205"
    ],
    [
      "0.590768421",
      "0.407701539"
    ],
    [
      "0.532205689",
      "0.489584977"
    ],
    [
      "0.183323020",
      "0.245375929"
    ],
    [
      "0.365807078",
      "0.351458939"
    ],
    [
      "0.121874584",
      "0.140729031"
    ],
    [
      "0.354719943",
      "0.575207780"
    ],
    [
      "0.427277414",
      "0.686483235"
    ],
    [
      "0.425312149",
      "0.035529358"
    ],
    [
      "0.648464164",
      "0.307769509"
    ],
    [
      "0.818046831",
      "0.215039225"
    ],
    [
      "0.305904255",
      "0.245919879"
    ],
    [
      "0.808150565",
      "0.026791608"
    ],
    [
      "0.304163008",
      "0.036074532"
    ],
    [
      "0.876793084",
      "0.127497511"
    ],
    [
      "0.546985264",
      "0.035182199"
    ],
    [
      "0.473675172",
      "0.587664241"
    ],
    [
      "0.548812561",
      "0.695576216"
    ],
    [
      "0.690095931",
      "0.216111067"
    ],
    [
      "0.494750165",
      "0.795857054"
    ],
    [
      "0.243749649",
      "0.140728952"
    ],
    [
      "0.412115548",
      "0.474446609"
    ],
    [
      "0.595252756",
      "0.600929765"
    ],
    [
      "0.675504464",
      "0.019592426"
    ],
    [
      "0.715435823",
      "0.413057117"
    ],
    [
      "0.745769772",
      "0.116382567"
    ],
    [
      "0.365925086",
      "0.141960870"
    ],
    [
      "0.060937510",
      "0.035182069"
    ],
    [
      "0.243425661",
      "0.350566604"
    ],
    [
      "0.182812283",
      "0.035182495"
    ],
    [
      "0.428656154",
      "0.247484672"
    ],
    [
      "0.487275981",
      "0.141068537"
    ],
    [
      "0.936607451",
      "0.030537563"
    ],
    [
      "0.303961438",
      "0.456112126"
    ],
    [
      "0.772940864",
      "0.312720968"
    ],
    [
      "0.465938555",
      "0.376858179"
    ],
    [
      "0.559338030",
      "0.215085448"
    ]
  ]
}

Submit points: exactly n centres, with each coordinate a decimal string of at most nine places. The verifier computes the shared radius; smaller is better. · Verifier v1.0.0

DISCUSSION

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.

No threads yet. Start the first discussion.