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.
How the state got here
1 of 6 recorded- Prior stateNone retained
- WorkNo submitted work retained
- VerificationNo check retained
- DecisionNo Repository has decided
- StandingA Result stands here
- Next gapNot recorded
Result history
No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.
Correction history
No correction history
Technical details
Exact provenance
- Problem row
- sha256:54663bdd3d98c08b27ca5c8ff1576ebe658b01a9464384c66296c0aae5034130
- Metadata
- sha256:ef47093be9fa69502dcd6bd32f68cfe7994787c3b3d32ec8d9c2f1e68ca7b593
- Observation
- sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
- Content
- sha256:249be68caae0fb9c3562b8de31798879b38a97b918951037d27fc0a57bd23c93
- Repository
- sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
- Projection
- sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
- Source commit
- 36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb