Erdős Problem #1103
Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: open (not automatically the live result).
Subject areas: number theory.
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.
UNACCEPTED DRAFT — mathematical editorial review pending
This material is a provisional, source-qualified manuscript published for line-by-line scrutiny and real HTML/LaTeX testing. It has NOT received separate GCL editorial acceptance or independent mathematical certification. Its presence on this website is not evidence of a solution, reviewed coverage, or final publication.
Review the underlying draft on GitHub.
The question in plain language
Can we construct an infinite set of integers whose pairwise sums are always squarefree, while keeping its elements relatively small? A number is squarefree if no square of a prime divides it.
Erdős Problem #1103 asks how rapidly an infinite increasing sequence
must grow if every number in \(A+A=\{a+b:a,b\in A\}\) is squarefree.
The definition includes self-sums \(2a\), not just sums of different elements. Erdős suspected that an infinite sequence with merely polynomial growth might not exist.
A small example
An exact search finds the four-element set
whose distinct pair sums, including the self-sums, are
Every one is squarefree. The verification tests divisibility by all prime squares up to the square root of each sum. This is only a finite example; the problem asks about an infinite extendible sequence.
What is known
Erdős originally noted that an exponentially growing sequence with squarefree pair sums exists.
The maintained problem page cites Konyagin (2004) and van Doorn and Tao (2025), reporting bounds including
and the existence of some sequence with
for sufficiently large \(j\). The stronger form of the lower estimate is derived from a finite-set extremal argument. These leave a substantial gap between known polynomial lower bounds and subexponential upper constructions.
An important source distinction concerns a much stronger condition Erdős also proposed: restricting each individual \(a\bmod p^2\) to the strictly positive lower half for every prime \(p\). The maintained source explains why that stricter requirement cannot hold for infinitely many \(a\). That is not a disproof of the weaker squarefree‑\(A+A\) problem.
GCL's current state
Authenticated source audit #2374 separately records the two conditions, the external 2025 results and the exact four-element example. The published 2025 authors' abstract confirms treatment of squarefree-sum sequence growth, but GCL has not reconstructed its full proof.
What remains
Review the original 1981, Konyagin 2004 and van Doorn–Tao 2025 proofs and determine the precise hypotheses and exponent losses. Separate the impossible stronger residue condition from the still-open minimum growth of a squarefree-sum infinite sequence.
Sources and claim boundaries
Erdős Problem #1103; Erdős (1981), p.180; Konyagin (2004); van Doorn–Tao (2025), arXiv:2512.01087; GCL source return #2374. The finite construction is independently verified; the infinite growth question is open. This draft is unaccepted.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2374 — 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.