Answers are grounded in this paper and cite their sources.
For Heilbronn's problem in a triangle, we give a computer-assisted proof that the largest possible minimum triangle area of eight points, divided by the area of the triangle, is 2θ = 0.0677892132…, where θ is the unique real root of the septic 1216512t⁷ + 1022976t⁶ − 2745456t⁵ + 2218730t⁴ + 32206304t³ − 19148615t² + 3156103t − 86233. This confirms the value conjectured by Chen, Zeng and Zhou. The value is attained only by the known configuration and its images under the six affine symmetries of the triangle. Optimality for n = 8 had previously been established by global optimization within solver tolerances, not rigorously. The proof ports the branch and bound of the nine-point square paper to the triangle. Every discarded box is discarded by a test evaluated in exact arithmetic. The run took 2.44·10^8 nodes and 9.6 hours on 14 worker processes, with no failures. The optimal value is identified exactly with the root of the septic. This is an AI-assisted, computer-assisted proof that has not been independently checked.
No takes yet. Share an insight, caveat, or question.
Ethan Hendren (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: