Erdős Problem #1142
Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
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.
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 find an integer \(n\) so that subtracting every power of two smaller than \(n\) but larger than one always produces a prime?
Erdős Problem #1142 asks whether infinitely many integers satisfy
Even the existence of a qualifying integer larger than \(105\) remains open.
A small example
The known numbers are
A complete exact integer-primality check for \(3\le n\le10000\) reproduces this list, with no additional qualifying integers.
There is a small logical convention at the lower endpoint. The literal condition for \(n=2\) is vacuously true, because no power of two lies strictly between one and two. The traditional list implicitly restricts attention to a nonempty test range, for example \(n\ge3\).
For \(n=15\), the relevant differences are \(15-2=13\), \(15-4=11\) and \(15-8=7\), all prime.
What is known
Mientka and Weitzenkamp (1969) proved that there are no further qualifying integers through \(2^{44}\), according to the maintained catalogue. GCL has not independently replayed that published proof.
Vaughan (1973) established a strong upper bound on the number of eligible \(n\le N\), of the form
for some \(c>0\) in its asymptotic range. This establishes sparseness but does not prove there are only finitely many such \(n\).
Erdős also posed a stronger quantitative conjecture about the number of prime shifts \(n-2^k\) for a typical or arbitrary \(n\). That is distinct from this all-prime requirement.
GCL's current state
Authenticated audit #2413 independently checks the nonvacuous finite range and records the published \(2^{44}\) claim without replacing source review with a smaller enumeration.
What remains
Inspect the original Mientka–Weitzenkamp and Vaughan papers, their endpoint conventions and theorem parameters, and assess whether later arithmetic restrictions strengthen the open existence question.
Sources and claim boundaries
Erdős #1142; Mientka–Weitzenkamp (1969); Vaughan (1973); Guy (2004); GCL source return. Exact finite list independently checked; open. Unaccepted draft.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2413 — 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.