Erdős Problem #244
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: open (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
Fix a real base \(C>1\). Consider the set of positive integers represented as
Erdős and Kalmár asked whether this set has positive natural density for every real base \(C>1\). The floor is essential for noninteger bases, and \(C\) must be fixed as the number of integers counted tends to infinity.
A small example
When \(C=2\), this is the classical prime-plus-powers-of-two representation problem. When \(C=3/2\), the first few floors are \(1,1,2,3,5,\ldots\); duplicated values must be counted only once in a set of represented integers.
Numerically observing many represented numbers up to a large cutoff does not establish a positive limiting density. The definition concerns the number of distinct integers represented, not the number of their representations.
What is known
The universal claim is OPEN. Romanoff (1934) proved positive-density results for every integer base \(C\ge2\). Ding (2025) proved the required positive-density statement for Lebesgue-almost every real \(C>1\).
Almost every does not mean every: a measure-zero exceptional collection of bases could still contain counterexamples. The maintained Erdős #244, updated October 2025, retains the open classification.
GCL's current state
Pinned and live status: OPEN. Original issue #1513. Romanoff's integer-base result and Ding's almost-everywhere theorem are source-attributed; neither proof was independently reconstructed by GCL.
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 task enumerates \(p+\lfloor C^k\rfloor\) with \(p\) prime and \(k\ge0\) for several rational bases and finite cutoffs. Acceptance: deduplicate repeated floor values, report distinct represented integers, and distinguish empirical proportions from a proved natural density. A research successor must address the genuinely exceptional noninteger bases not covered by Ding's almost-everywhere theorem.
Sources and claim boundaries
- Erdős #244, Romanoff [Ro34], Ding [Di25] and original Erdős [Er61].
- Original issue #1513.
No universal positive-density theorem, independent analytic proof or editorial admission is claimed.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #1513 — 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.