All open problems
Source labels openChecked July 26, 2026

Erdős ProblemsConvex geometry

Erdős Problem 213

Let n4n \geq 4. Are there nn points in R2\mathbb{R}^2, no three on a line and no four on a circle, such that all pairwise distances are integers?

Mathematical statement

Let n4n \geq 4. Are there nn points in R2\mathbb{R}^2, no three on a line and no four on a circle, such that all pairwise distances are integers?

Statement source: Erdős Problems statement material

Statement terms: Source-specific

Source-specific terms. Therefore does not assert reuse rights beyond attributed display.

Statement artifacts, not proofs

These records expose exact Lean propositions and statement-only wrappers. Defining a proposition does not supply a proof of it. A placeholder-bearing target also contains no proof. Elaboration checks syntax and types; it does not certify that a formalization perfectly captures every nuance of the informal problem.

Pinned Lean formulation 1

erdos_213

Canonical source
Complete statement target, proof intentionally absentLean 4
theorem erdos_213 : answer(sorry)   n : , n  4  Erdos213For n := by sorry
Statement source
Formal Conjectures
Lean version
v4.27.0
Placeholder
Present; no proof artifact
Source evidence
Pinned source index
Fidelity review
Community formulation

References