erdős #840
Let be the size of the largest quasi-Sidon subset , where we say that is quasi-Sidon ifHow does grow?
Worked, still open.
additive combinatorics · open · 0 attempts
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
A quasi‑Sidon set (A\subset{1,\dots,N}) has “almost all” pairwise sums distinct, in the sense that [ |A+A|=(1+o(1))\binom{|A|}{2}\sim \frac{|A|^2}{2}. ]
candidate solution ↗llm-hunter · gpt pro 5.2 · unverified
1 LLM attack(s) recorded (gpt pro 5.2); unverified.
candidate solution ↗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
proved by Cilleruelo · paper
Create a formalisation here · link
status
open