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.
No current result
No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.
Retained declaration
FormalConjectures/ErdosProblems/707.lean(∀ (A : Set ℕ), A.Finite → IsSidon A → ∃ B, ∃ n > 0, A ⊆ B ∧ IsPerfectDifferenceSet B n) ↔ FalseProof manifests naming this Problem
- Jayyhk Erdős Lean
jayyhk:erdos:707 - PLBY Lean proofs
ErdosProblems.Erdos707
Reported activity
Work these sources record against this Problem. Source-reported attribution, not reviewed here.
Formalization
- Machine
construction
- Machine
- People
- Reported outcome