Erdős Problem #44
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: open (not automatically the live result).
Subject areas: number theory, sidon sets, additive combinatorics.
Read this status correctly
The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.
The question in plain language
A Sidon set has a unique representation for every unordered sum of two elements, including when both summands are equal. Dense finite Sidon sets can have roughly \(\sqrt N\) elements below \(N\), but can any prescribed finite Sidon set be extended by adding larger numbers until it is nearly this dense?
Erdős Problem #44 asks whether, for every \(N\ge1\), every Sidon set \(A\subseteq[1,N]\), and every \(\varepsilon>0\), there exist \(M>N\) and \(B\subseteq[N+1,M]\) such that \(A\cup B\) remains Sidon and
The maintained public source continues to classify this as OPEN.
A small example
Take \(A=\{1,2,4\}\) and extend it with \(B=\{8,13\}\). The combined set
is Sidon: its 15 unordered sums with repetition are
all different. It has five elements below 14, exceeding \(\sqrt{13}\). This provides one finite successful extension but does not answer the universal question.
What is known
Classical Sidon-set constructions can be dense when we are free to choose all elements. Problem #44 is stronger: it fixes an arbitrary initial set \(A\), forbids deleting or changing old elements, and requires every new element to exceed \(N\).
There is an important quantifier issue. The extension limit \(M\) must be allowed to depend on \(N\), \(A\) and \(\varepsilon\). A shorthand saying only \(M=M(\varepsilon)\) cannot literally be correct for every arbitrarily large \(N\), because the theorem also requires \(M>N\). The actual frozen formal theorem has nested quantifiers allowing the intended dependence, despite an ambiguous informal docstring.
GCL's current state
Source audit #1313 compared the public problem, contributor discussion and pinned Formal Conjectures statement, and verified the finite 15-sum example by exact integer arithmetic. The research theorem remains unfilled in the frozen provider. No general Sidon extension theorem is claimed in GCL.
What remains
Prove that every finite Sidon starting configuration can be extended to arbitrary near-optimal density at some larger cutoff, or establish a genuine obstruction. Bounded search may test algorithms but cannot prove the quantified infinite result.
Sources and claim boundaries
- Erdős Problems #44: OPEN question and original bibliography.
- Contributor discussion: ambiguity over the extension cutoff's dependencies, not a proof.
- Frozen Formal Conjectures #44: nested quantifiers and unfilled research theorem.
- GCL source return #1313: source audit and checked example, no MathCert.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #1313 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: PROTECTED_READY_BACKLOG.
- Formal-statement coverage: A provider statement was included in the pinned snapshot. Presence does not mean the statement or proof has been checked.
- External mathematical status: consult current problem page and its dated bibliography.