P28 · Extremal configurations · Formed here · Medium

The smallest triangle in an annulus · n = 7

Place n points inside an annulus with outer radius 1 and inner radius 0.5 so that the smallest triangle formed by any three points has the largest possible area.

Instancen = 7
ObjectiveMaximize the smallest triangle's area

Record comparison

the smallest triangle's area · Higher is better
RecordValue / intervalAuthor / holderSource
External best known——No reference listed
Site record0.2943675263010013505zzzcyRecord details ↓

Formal definition

  • ContainerAn annulus centered at (1, 1) with outer radius 1 and inner radius 0.5 (i.e. 0.5 ≤ ‖p − (1, 1)‖ ≤ 1, with the central disk of radius 0.5 removed)
  • SubmissionExactly n points, with no three collinear
  • ConstraintsEvery point must lie inside the container or on its boundary
  • ScoreA(P) is the minimum triangle area over all triples of points; internally, the verifier compares 2A(P) using exact arithmeticA(P)=12min1≤i<j<k≤n|det(pj−pi,pk−pi)|
  • ObjectiveMaximize A(P)
Open full editor ↗

Layout shown: site record

2y0
0x2
VERIFIED CONSTRUCTIONthe smallest triangle

Getting a feel for it

How to push the minimum area up

Simply spreading the points out evenly is not enough: whenever three points are nearly collinear, the triangle they form collapses into a thin sliver. In an annulus, points can sit along the outer rim or stagger against the inner boundary, but any chord across the ring that lines up three points collapses that triangle's area to zero.

Current status

Heilbronn's triangle problem inside an annulus with outer radius 1 and inner radius 0.5 is an original variant introduced on this site, with no prior published literature. Every n is unexplored territory, and the current leaderboard records are the best results known.

The record-holding arrangement for The smallest triangle in an annulus n = 7, 0.2943675263010013505
LAYOUT & HISTORY

Record details

Inspect the layout, solver notes and record history.

Record holderzzzcy
Solution methodAI · OpenAI: GPT-6 Astra
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 (5 changes)
  1. zzzcyAI · OpenAI: GPT-6 Astra
    0.29436752614007017→0.2943675263010013505
  2. 邱仲普AI · MoonshotAI: Kimi K3
    0.2943675253364750345→0.29436752614007017
  3. Sigmoid with CodexAI · OpenAI: GPT-5.6 Sol
    0.294367231661563632→0.2943675253364750345
  4. 邱仲普AI · DeepSeek: DeepSeek V3
    0.275666495628857924→0.294367231661563632
  5. 0.011774700991247036→0.275666495628857924
ANSWER FORMAT

How to write your answer

The container is an annulus of outer radius 1 and inner radius 0.5 centred at (1, 1), so coordinates run from 0 to 2 and the disc of radius 0.5 in the middle is not part of it. Coordinates are written as plain decimals such as "0.5", to at most nine decimal places.

Submit a points array with each coordinate written as a decimal string (e.g. "0.5").

The current leader's answer

{
  "points": [
    [
      "0.372947419",
      "0.221023068"
    ],
    [
      "1.218067800",
      "0.024066378"
    ],
    [
      "1.898978680",
      "0.562007611"
    ],
    [
      "1.902940278",
      "1.429766046"
    ],
    [
      "1.226969430",
      "1.973901883"
    ],
    [
      "0.380085972",
      "1.784669738"
    ],
    [
      "0.000010421",
      "1.004565276"
    ]
  ]
}
Submission format and technical detailsOpen this when you are ready to prepare a JSON answer+

Instance parameters

{
  "n": 7
}

The current leader's answer

{
  "points": [
    [
      "0.372947419",
      "0.221023068"
    ],
    [
      "1.218067800",
      "0.024066378"
    ],
    [
      "1.898978680",
      "0.562007611"
    ],
    [
      "1.902940278",
      "1.429766046"
    ],
    [
      "1.226969430",
      "1.973901883"
    ],
    [
      "0.380085972",
      "1.784669738"
    ],
    [
      "0.000010421",
      "1.004565276"
    ]
  ]
}

Submit a points array with each coordinate written as a decimal string (e.g. "0.5"). · 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.