Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. T. Feng, T. Trinh, G. Bingham et al., Semi-Autonomous Mathematics Discovery with Gemini: A Case Study on the Erdős Problems, arXiv:2601.22401v3 (5 February 2026); Section 4.3, the problem and Remark 4.3 on p. 24, the solution on pp. 24--26. The result is unnumbered. The artifact is identified on the source card.
Read depth. Claims checked: the assertion and the proof (pp. 24--26) were read through on the print; the list of two-distance four-point configurations is asserted in the paper from "elementary observations" (p. 25) and was not checked here, nor was the cited counting theorem. Nothing here is independently reviewed. A preprint.
Statement
Let , the ring of integers of embedded in , and let be the points of closest to the origin. The paper proves (pp. 24--26) that determines distinct distances and that every distinct points of determine at least distinct distances; the answer to the question is affirmative.
Proof pointer
Squared distances in are values of the form of discriminant up to , and Bernays's extension of the Landau--Ramanujan theorem counts the integers up to so represented as (p. 25). Every planar two-distance four-point set is, by the paper's list, similar to one of six configurations; the isosceles trapezoid needs an irrational squared-distance ratio, and the rest contain a square or an equilateral triangle, neither of which fits in because and are not in (pp. 25--26).
Dependencies
Bernays (1912), the asymptotic count of integers represented by a positive definite binary quadratic form (cited, not held).
Bears on
- Problem 659: answers the question as posed affirmatively. The paper classifies the case as an independent rediscovery: Remark 4.3 (p. 24) reports essentially the same result in a 2014 blog post of Sheffer, from an argument of Sheffer and Lund that does not treat the trapezoid configuration, and a later full solution by Grayzel.