erdős #152
For any , if is a sufficiently large finite Sidon set then there are at least many such that .
Worked, still open.
sidon sets · solved · formalized (Lean) · 0 attempts
machinery: Sidon/B_h,additive-combinatorics,consecutive-integer-window,extremal-set-system
use this record
vela registry pull vfr_37aec80d874a0239vela reproduce examples/erdos-problemsevidence
alphaproof · AlphaProof Nexus (DeepMind) · machine-verified (Lean)
Machine-verified Lean proof (kernel-checkable, sorry-free).
Lean proof ↗unverified AI candidates (2)
gpt-erdos · GPT-5.2 Pro + Deep Research · unverified
Let (A={a_1<a_2<\dots<a_k}\subset\mathbb N) be a finite **Sidon set** [[nomath]](i.e. all sums $a_i+a_j$ with $i\le j$ are distinct)[[/nomath]]. Put [ S:=A+A={a_i+a_j:\ 1\le i\le j\le k}. ] Then the condition
candidate solution ↗llm-hunter · gpt pro 5.2 · unverified
1 LLM attack(s) recorded (gpt pro 5.2); unverified.
candidate solution ↗formal
AMS 5 · solved (literature)
theorem erdos_152 : answer(True) ↔ Tendsto f atTop atTopformal-conjectures/152.lean ↗
Kernel-checked proof; human-attested statement.
- faithful — reviewer:will-blair
erdos_152.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