Erdős problem 707
Erdős conjectured, in over a dozen papers spanning 1976 to 1997 and with a 1000 dollars prize attached, that every finite Sidon set extends to a perfect difference set modulo for some prime . Alexeev and Mixon establish that is a counterexample - and discovered along the way that Marshall Hall, Jr. had published a different counterexample three decades before Erdős first posed the problem, unnoticed by the community for half a century.
Sources
FormalConjectures/ErdosProblems/
707.lean
Retained formal statement
Alexeev and Mixon [arxiv/2510.19804] have disproved this conjecture, showing that cannot be extended to any perfect difference set.
∀ (A : Set ℕ), A = {1, 2, 4, 8, 13} → Finite ↑A ∧ IsSidon A ∧ ∀ (B : Set ℕ) (n : ℕ), A ⊆ B → ¬IsPerfectDifferenceSet B nSolvedStatement only, no proof