erdős #212
Is there a dense subset of such that all pairwise distances are rational?
Worked, still open.
geometry · open · formalized (Lean) · 0 attempts
use this record
vela registry pull vfr_37aec80d874a0239vela reproduce examples/erdos-problemsevidence
unverified AI candidates (2)
gpt-erdos · GPT-5.2 Pro + Deep Research · unverified
This is exactly the **Erdős–Ulam problem**:
candidate solution ↗llm-hunter · gpt pro 5.2 · unverified
1 LLM attack(s) recorded (gpt pro 5.2); unverified.
candidate solution ↗formal
AMS 52 · open (literature)
theorem erdos_212 : answer(sorry) ↔
∃ u : Set ℂ, Dense u ∧ u.Pairwise fun c₁ c₂ => dist c₁ c₂ ∈ Set.range Rat.castformal-conjectures/212.lean ↗links
a blogpost · paper
status
open