Problems/Erdos Distinct Distances Problem

Erdos Distinct Distances Problem

GeometrySOLVED
Year
1946
Difficulty
*****
Solved by
Larry Guth & Nets Hawk Katz (2015)

Statement

n points in the plane determine at least Omega(n/log n) distinct distances.

g(n)=Ω ⁣(nlog⁡n)g(n) = \Omega\!\left(\frac{n}{\log n}\right)

About this Problem

Resolved up to log factor using algebraic methods and polynomial partitioning. A breakthrough in discrete geometry.

About the Lean 4 Prover

Lean 4 is a theorem prover and programming language. When a proof compiles in Lean, it is mathematically certain to be correct — the type checker verifies every logical step. This is the gold standard for formal verification.

Our platform uses fal.ai serverless compute to run Lean verification, and Gemini to generate proof strategies that are then formally checked. ShinkaEvolve provides the evolutionary backbone for automated mathematical discovery.

Mathematical Art

Generate a unique AI illustration of this problem using fal.ai FLUX.

Connected Constellations