Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Problem 827
claims/: The 4 claim pages of Problem 827, one per claimant's result; the problem's standing derives from them.
Statement. Let be minimal such that if points in are in general position then there exists a subset of points such that all triples determine circles of different radii.
Determine .
Formulation. The value of depends on what general position means. Erdős's 1975 statement [Er75h] defines it as no three points on a line and no four on a circle, and this page reads the problem that way. Martínez and Roldán-Pensado [MaRo15] work with the weaker condition that no four points lie on a line or a circle, which admits more point sets and so can only raise . Their upper bounds hold under both readings; under the weaker one only is known.
Status. Open.
Source. erdosproblems.com/827, accessed 2026-09-04. Cite as: T. F. Bloom, Erdős Problem #827, https://www.erdosproblems.com/827.
References.
- [Er75h] Erdős, P., Some problems on elementary geometry. Austral. Math. Soc. Gaz. (1975), 2-3.
- [Er78c] Erdős, P., Some more problems on elementary geometry. Austral. Math. Soc. Gaz. (1978), 52-54.
- [Er92e] Erdős, Pál, Some Unsolved problems in Geometry, Number Theory and Combinatorics. Eureka (1992), 44-48.
- [MaRo15] Martínez, L. and Roldán-Pensado, E., Points defining triangles with distinct circumradii. Acta Math. Hungar. 145 (2015), no. 1, 136-141.
Formalization. None recorded for the problem. The Lean development of Kiichi's proof that is linked from its claim page; this corpus has not built it.
Current assessment
The question. Erdős asked in [Er75h] whether exists at all, and said he could not prove that it does. In [Er78c] he gave an argument for an explicit polynomial bound, which misses a case. The site labels the problem OPEN.
Claims. Martínez and Roldán-Pensado prove, in a refereed paper, that exists and , with and ; their Section 2 locates the gap in Erdős's 1978 argument. Martínez-Sandoval, Raggi and Roldán-Pensado derive from a sunflower anti-Ramsey theorem in an arXiv manuscript of 2015. Two independent proofs that were posted on the site's thread in September 2026: a computer-assisted one by sallerk and a Lean-checked one by Kiichi, whose co-authors are instances of Claude. Neither has an outside review.
Results without a claim page. Two thread posts give asymptotic bounds without a manuscript, so they have no page. On 10 May 2026 FlaredRain posted a random-deletion proof of , which counts the pairs of triples with equal circumradius; the post says an unnamed AI model found its core, and the site's commentary credits the bound to it. The manuscript of Martínez-Sandoval, Raggi and Roldán-Pensado already gives a sharper bound. On 16 June 2026 SamKorsky posted the lower bound , from a generic planar projection of a grid lifted to a paraboloid: a set with all circumradii distinct contains no parallelogram, so its preimage has distinct differences. The post says GPT-5.5 was used to write it and to check its calculations. Erdős's 1978 argument has no page, since it is incorrect.
Remaining gaps. On the accepted record, exists and . With the claimed results, and , and SamKorsky's post gives . The order of growth of and every value with are open.
Linked library material
These entries are derived from explicit links on library pages. They are navigation only and do not by themselves record mathematical progress.
- erdos_1975_problems_elementary_geometry
- erdos_1975_problems_elementary_geometry / question_p3
- erdos_1978_more_problems_elementary_geometry
- erdos_1978_more_problems_elementary_geometry / inequality_1
- martinez_2015_points_defining_triangles_distinct_circumradii
- martinez_2015_points_defining_triangles_distinct_circumradii / lemma_4_1
- martinez_2015_points_defining_triangles_distinct_circumradii / theorem_1_1
- martinez_2015_points_defining_triangles_distinct_circumradii / theorem_1_2