erdős #42
Let and be sufficiently large in terms of . Is it true that for every Sidon set there is another Sidon set of size such that ?
Worked, still open.
number theory · solved · formalized (Lean) · 0 attempts
machinery: Sidon/B_h,additive-combinatorics,disjoint-difference-sets,compact-Cayley-construction,prime-distribution
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 exact question is currently **not known** in general.
candidate solution ↗llm-hunter · gpt 5.2, gpt pro 5.2 · unverified
3 LLM attack(s) recorded (gpt 5.2, gpt pro 5.2); unverified.
candidate solution ↗formal
AMS 5 11 · solved (literature)
theorem erdos_42 : answer(True) ↔
∀ M ≥ 1, ∀ᶠ N in atTop, ∀ (A : Set ℕ) (_ : IsMaximalSidonSetIn A N),
∃ᵉ (B : Set ℕ), B ⊆ Set.Icc 1 N ∧ IsSidon B ∧ B.ncard = M ∧
((A - A) ∩ (B - B)) = {0}formal-conjectures/42.lean ↗links
Vela Sidon frontier (A309370) · verified work
A B₂/Sidon problem — the same object family as Vela's verified Sidon records, where nine improved terms were accepted into OEIS A309370 (the campaign's first external adoption).
OEIS A309370 ↗ · verified-combinatorics (witnesses + verify.py) ↗ · the Erdős campaign
status
solved