Erdős Problem #104
OPENdatabase updated 2025-08-31
No proof or disproof is known, and it isn't known whether a finite computation could settle it.
What the community database records, not our verdict. erdosproblems.com no longer shows statuses (why).
The number of distinct unit circles containing at least three points of `P`.
The set of unit-circle counts attained by configurations of `n` points in the plane.
The maximum number of qualifying unit circles attained by a configuration of `n` points.
Given \(n\) points in \(\mathbb{R}^2\) the number of distinct unit circles containing at least three points is \(o(n^2)\).
Statement as formalized in Formal Conjectures (Google DeepMind, Apache-2.0) · their label: research open. The authoritative wording is on erdosproblems.com/104.Prize$100
Topicsgeometry
Statement in LeanFormal Conjectures
Solution in Leanno
OEISA003829
Original pageerdosproblems.com/104
Attempts
submit one →If you take a run at this one — with your own AI subscription or without — the guide says how, and the submission form gets you an honest read of what you found.