Erdős Problem #237
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: proved (not automatically the live result).
Subject areas: number theory, primes.
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 \(A\) be a set of positive integers, and let \(R_A(n)\) count the representations
Erdős asked whether \(R_A(n)\) is unbounded when \(A\) contains at least a constant multiple of \(\log N\) elements up to \(N\) for all sufficiently large \(N\). Formally, the target is
The representation count is ordered only by the choice of \(a\in A\): each such \(a\) determines the unique candidate prime \(n-a\).
A small example
Take \(A=\{1,2,4,8,\ldots\}\). A particular integer \(n\) is represented once for every exponent \(k\) for which \(n-2^k\) is prime. This specializes the question to #236, but unboundedness of that count does not assert the stronger estimate \(o(\log n)\) or its negation.
A finite set \(A\) yields \(R_A(n)\le |A|\) uniformly, so the assumption that \(A\) is infinite is essential.
What is known
PROVED, under a stronger conclusion about the hypothesis. Erdős (1950) handled the powers-of-two set. Chen and Ding (2022), as recorded in Erdős #237, established the desired unboundedness for every infinite set \(A\subseteq\mathbb N\), without any logarithmic lower bound for its counting function.
Thus the historical density condition can be discarded entirely, but the conclusion remains a limsup rather than a claim that every sufficiently large \(n\) has many representations. The proof is a result about prime shifts of an arbitrary infinite sequence, not merely an application of the prime number theorem to a fixed finite list.
GCL's current state
Pinned and live status: PROVED. Original issue #1506. Chen–Ding's theorem and the stronger infinitude hypothesis are source-attributed; the full analytic proof was not independently reconstructed.
The original issue contains an authenticated RESULT/1 source report. This is unadjudicated source evidence only, not independent mathematical certification or editorial admission.
What remains
A bounded successor enumerates \(R_A(n)\) for sample infinite sets truncated at a cutoff, including powers of two and sparse squares, using exact primality checks. Acceptance: a finite experiment is not offered as proof of an infinite limsup; the statement requires merely \(A\) infinite, not positive density or even logarithmic growth.
Sources and claim boundaries
- Erdős #237, Chen–Ding [ChDi22], original [Er55c], [Er61].
- Original source issue #1506.
No new arbitrary-set prime-shift theorem, independent complete proof or editorial admission is claimed.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #1506 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
- 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.