Erdős Problem #819
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: open (not automatically the live result).
Subject areas: 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
Let k=floor(sqrt N). Among all A subset {1,...,N} of EXACT size k, define f(N) as the MAXIMUM cardinality of (A+A)∩[1,N]; summands may be equal. Estimate f(N)/N, not the full (untruncated) sumset size.
A small example
Exact exhaustive finite checks: N=5, k=2 gives f(5)=3, attained by A={1,2}; N=9, k=3 gives f(9)=6, for example A={1,3,4}; N=16, k=4 gives f(16)=10, A={2,4,7,8}. The finite ratios need not lie between asymptotic 3/8 and 1/2 due to o(1) terms.
What is known
Maintained https://www.erdosproblems.com/latex/819, read 2026-10-14, credits Erdős–Freud [ErFr91], On sums of a Sidon-sequence, Journal of Number Theory (1991), 196–205, with (3/8-o(1))N<=f(N)<=(1/2+o(1))N. Sharp constant remains OPEN and connected to quasi-Sidon sets (#840). Original 1991 proof uninspected.
The exact parameter is \(k=\lfloor\sqrt N\rfloor\). Counting unordered pairs of selected elements, WITH repetitions, gives \(k(k+1)/2\) candidate sums; collisions and sums exceeding \(N\) can only reduce the number counted. The published bounds are asymptotic, \((3/8-o(1))N\leq f(N)\leq(1/2+o(1))N\). The finite value \(f(9)=6\) does not contradict the asymptotic upper coefficient because the unspecified \(o(1)\) term may be substantial for small \(N\).
The optimization must retain the truncation:
$$
f(N)=\max_{\substack{A\subseteq[1,N]\ |A|=\lfloor\sqrt N\rfloor}} \left|(A+A)\cap[1,N]\right|.
$$
The elementary pair-count upper bound is \(\lfloor\sqrt N\rfloor(\lfloor\sqrt N\rfloor+1)/2\), before subtracting coincident or oversized sums. Erdős–Freud's asymptotic half-interval upper bound is more delicate, and its unspecified error does not conflict with the exact small value \(f(9)=6\).
GCL's current state
The original authenticated RESULT/1 source return records BOUNDED_TASK_DESIGNED and retains the original mathematical qualifications. This is an editorially reviewed explanatory article in the EC-BULK-005-R9 protected batch, effective only when that exact-hash transaction merges. The corresponding maintained Erdős statement and its bibliography were inspected. This editorial decision does not certify any full original theorem proof, independent external formalization, or Lean kernel check.
Preserved source-review qualifications: open truncated sidon style pair sum density. See the immutable 128-case critical review record for the complete source-return caveats.
What remains
Write exact brute force enumerator for N=5,9,16 with repeated-element sums and truncation <=N; verify reported counts and avoid reading finite 6/9 as contradiction to a large-N half-bound. Inspect Erdős–Freud 1991 proof and quasi-Sidon link #840.
Critical review must independently verify the original primary theorem, hypotheses, quantitative constants and simple examples. Passing source tests does not establish publication or mathematical proof certification.
Sources and claim boundaries
- Erdős problem #819, maintained LaTeX and original authenticated source return, checked 14 October 2026.
- Pinned teorth/erdosproblems revision 536408716724a2402bdfa7c1d764bf83d64a8c89, data/problems.yaml, Git blob 4e60263a80af6207aca494d2e1388e44fa372889. The source comment contains original bibliography and limits of direct proof inspection.
- Editorial acceptance: NONE. Protected merge: NONE. Real-browser MathJax: NOT VERIFIED. Lean/new theorem certification: NOT CLAIMED.
Editorial source decision: R9 critical review, REVIEWED as a source-grounded explanation only. All open mathematical questions, primary-proof fidelity obligations, and external formalization caveats remain separate.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2090 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: STATEMENT_CAPTURE_REQUIRED.
- Formal-statement coverage: No statement was confirmed in GCL's pinned formal-provider snapshot. Presence does not mean the statement or proof has been checked.
- External mathematical status: consult current problem page and its dated bibliography.