erdős #89 · Erdős distance problem

← #88 · #90 (packet.json; erdosproblems.com)

Does every set of distinct points in determine many distinct distances?

claimed — no verifier run, no signed judgmentunreviewedOpen. Worked here; no verified result yet.

geometry · open · prize $500 · formalized (Lean) · 0 attempts

machinery: geometric,distinct-distances,polynomial-method,incidence-geometry,Guth-Katz,Elekes-Sharir,prime-distribution

use this data

vela registry pull vfr_37aec80d874a0239
vela reproduce examples/erdos-problems

Evidence

unverified AI candidates (2)

gpt-erdos · GPT-5.2 Pro + Deep Research · unverified

This is basically the remaining gap in the **Erdős distinct distances problem**. Erdős showed that a (\sqrt n \times \sqrt n) integer grid can have only about [ \Theta!\left(\frac{n}{\sqrt{\log n}}\right) ] distinct distances, so you cannot hope for a general lower bound bigger than this (up to constants). ([MIT OpenCo…

candidate solution ↗

llm-hunter · codex 5.2 extra high, gpt 5.2, gpt pro 5.2 · unverified

3 LLM attack(s) recorded (codex 5.2 extra high, gpt 5.2, gpt pro 5.2); unverified.

candidate solution ↗

Formal proof

AMS 52 · open (literature)

theorem erdos_89 :
    (fun (n : ℕ) => n/(n : ℝ).log.sqrt) =O[atTop] (fun n => (minimalDistinctDistances n : ℝ))
formal-conjectures/89.lean ↗

OEIS2

Check it yourself

One command re-derives this record's receipts on your machine.

vela reproduce examples/erdos-problems

Verify this yourself

Run this command — the output must match these fingerprints.

vela reproduce examples/erdos-problems
  • packet.json · sha256 8becb69b27791f1bd668bc977c71e310a6a7a809807a4dc145dd7800a89a8693

Search Vela

Search problems, results, contributors, and pages — or jump straight to an id.