Skip to content

Erdős Problem #236

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

For each positive integer \(n\), count the ways to represent it as a prime plus a power of two:

\[ R(n)=\#\{(p,k): p\text{ prime},\ k\ge0,\ n=p+2^k\}. \]

Erdős asked whether \(R(n)=o(\log n)\) as \(n\to\infty\). The count includes the representation with \(2^0=1\), and different exponents count as different solutions if their remainders are prime.

A small example

For \(n=11\), the eligible powers below \(n\) are \(1,2,4,8\). The remainders \(10,9,7,3\) are prime precisely for the last two, giving \(R(11)=2\). At any \(n\), the trivial bound is \(R(n)\le1+\lfloor\log_2 n\rfloor\), of order \(\log n\). The question is whether the ratio to \(\log n\) actually tends to zero for every large integer.

A finite list with a small ratio cannot prove a little-oh estimate, while a single integer with a high ratio cannot disprove it.

What is known

OPEN. Erdős (1950) constructed infinitely many integers with \(R(n)\gg\log\log n\). Thus the number of representations can grow without bound, but this lower bound is still compatible with \(o(\log n)\).

A harder related question, #1142, asks whether there are infinitely many \(n\) for which every eligible remainder \(n-2^k\) is prime. Even if such numbers existed, one would need them on an unbounded sequence to disprove the little-oh claim. The maintained Erdős #236 cites OEIS A109925.

GCL's current state

Pinned and maintained status: OPEN. Original issue #1505. A frozen formal statement is reported upstream; no proof of a new asymptotic bound or kernel replay is claimed.

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 computes \(R(n)\) for all \(n\) up to a fixed cutoff with an exact prime sieve, checks \(R(11)=2\) and graphs maximum ratios over growing windows. Acceptance: allow \(k=0\) but require a positive prime remainder; distinguish existence of many representations along a subsequence from a universal upper bound.

Sources and claim boundaries

No new prime-plus-power representation theorem or editorial admission is claimed.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #1505 — 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.

Back to catalogue · Compendium introduction