Erdős Problem #1209
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
Erdős Problem #1209 currently has source status MIXED — GENERAL TRANSLATION FALSE.
For an arbitrarily rapidly growing integer sequence \(A=(a_k)\), does existence of one translation \(n\) with every \(n+a_k\) prime (or squarefree) imply infinitely many translations? Without restrictions on \(A\) this is false by diagonalization: at stage \(k\) arrange \(a_k+k\) to be divisible by a nontrivial prime (or a prime square), eliminating \(n=k\). Separately ask about the highly structured shifts \(n+2^{2^k}\), with 'all terms prime', 'all squarefree', and 'infinitely many prime/squarefree' different questions.
A small example
For \(1\le k\le7\), phase25 constructs increasing primes \(a_k\), and verifies selected \(q_k\nmid k\) dividing \(a_k+k\); for instance \((k,a_k,q_k)=(1,3,2),(2,7,3)\). The finite diagonal prefix rules out the corresponding seven translations only. Extending to every positive translation requires the infinite Dirichlet construction, not just these examples.
What is known
The maintained https://www.erdosproblems.com/1209 explains the unrestricted diagonal construction: choose primes \(a_k\equiv-k\bmod q_k\) where \(q_k\) is a prime not dividing \(k\). Dirichlet's theorem permits arbitrarily fast growth; replacing \(q_k\) by \(q_k^2\) provides a squarefree obstruction. An ebarschkis/GPT argument from 2026 reportedly proves no integer shift makes all \(n+2^{2^k}\) prime, by recurring divisibility using multiplicative orders. The infinitely-often and squarefree variants are not thereby resolved; source review remains pending.
GCL's current state
Authenticated original-issue research return. The finite example was independently replayed with ci/erdos_compendium_007_phase25_checks.py; the source-attributed theorem and any general set-theoretic conclusions are NOT independently certified. This manuscript is a LOCAL UNACCEPTED EDITORIAL DRAFT.
What remains
Reconstruct and source-check the Dirichlet diagonal argument including squared-modulus residue classes, and independently inspect the recent multiplicative-order proof for structured double powers. Do not claim a result on infinitely-often primality solely from an all-prime obstruction.
Mathematical source fidelity, any independent critical review, protected V2 editorial admission and live public deployment are distinct unfinished gates.
Sources and claim boundaries
https://www.erdosproblems.com/1209 ; [Er80,p.111], #429,#1102; ebarschkis/GPT external 2026 proof.
Finite receipt: governance/erdos_compendium/batches/EC-BULK-007_FINITE_CHECKS_PHASE25.json. Original issue SHA/identity frozen and checked.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2480 — 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.