Erdős Problem #1065
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
A prime number sometimes has the form
where \(q\) is another prime and \(k\) is a nonnegative integer. Erdős Problem #1065 asks whether infinitely many primes have this form. It asks a second, more permissive question about
again with \(q\) prime. The second family contains the first by setting \(\ell=0\). Showing infinitude of the larger family would not automatically establish infinitude of the smaller one.
A small example
Several small primes work: \(3=2^0\cdot2+1\), \(7=2\cdot3+1\), \(11=2\cdot5+1\), \(13=4\cdot3+1\), \(29=4\cdot7+1\), and \(41=8\cdot5+1\). These identities and the relevant primality checks were independently verified. The pattern alone does not guarantee a prime: \(2^4\cdot3+1=49=7^2\).
There is also a useful boundary observation. When \(k=0\), the first form reads \(p=q+1\). If \(q\) is any odd prime, \(q+1\) is even and larger than \(2\), hence composite. So the only \(k=0\) example is \(q=2\), \(p=3\).
What is known
The maintained catalogue records both infinitude questions as open. It cites Richard Guy, Unsolved Problems in Number Theory, problem B46. The precise printed Guy page and any earlier original Erdős source remain to be checked.
GCL's current state
Authenticated source audit #2336 identifies the two different quantifiers and verifies finite prime witnesses. The pinned Lean source records both infinitude statements but does not prove them. Neither the finite arithmetic nor source metadata amounts to a GCL-certified theorem.
What remains
A resolution needs an infinitude theorem or a counterexample to one of the conjectured infinite families. As a bounded precursor, independently enumerate prime witnesses through a fixed cutoff and compare Guy's exact mathematical formulation with the frozen formal statements. Explicitly preserve the \(k=0\) and \(\ell=0\) cases.
Sources and claim boundaries
- Erdős Problem #1065, statement and maintained open status.
- Richard K. Guy, Unsolved Problems in Number Theory (2004), B46; page-level source lock outstanding.
- Frozen formal source.
- Authenticated source audit #2336, partial research and finite checks only, not protected admission.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2336 — 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.