Erdős Problem #695
Editorial depth: Reviewed explanatory article — evidence qualified.
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.
The question in plain language
A prime chain is a strictly increasing sequence p_1<p_2<... of primes such that p_{i+1}≡1 (mod p_i). Erdős asks (a) whether for every infinite prime chain p_k^{1/k}→∞, and (b) whether SOME chain grows as slowly as exp(k(log k)^{1+o(1)}). Both remain OPEN. The first universal lower question and the second existential upper question must not be conflated.
A small example
An exact five-term prime chain is 2,3,7,29,59: 3≡1 mod2, 7≡1 mod3, 29≡1 mod7, and 59≡1 mod29. Each term is prime and strictly larger. This demonstrates a finite chain but cannot decide the possible growth of all infinite chains.
What is known
Dirichlet's theorem supplies at least one larger prime ≡1 mod p for each current prime p, so finite chains can be extended indefinitely by successive choices (with the usual classical theorem, not a GCL new proof). Linnik's theorem gives a coarse doubly exponential upper estimate for the greedy least-successor chain. The source reports a much sharper upper rate conjecture, conditional on finding prime successors ≤p(log p)^{O(1)}. The pinned #695.lean directly inspected has two answer(sorry) questions and by sorry proof bodies; no certificate of either asymptotic. Ford–Konyagin–Luca [FKL10] original finite-chain study was not rechecked.
GCL's current state
The original authenticated RESULT/1 source return records BOUNDED_TASK_DESIGNED and retains the original mathematical qualifications. This is an editorially reviewed explanatory article in the EC-BULK-005-R9 protected batch, effective only when that exact-hash transaction merges. The corresponding maintained Erdős statement and its bibliography were inspected. This editorial decision does not certify any full original theorem proof, independent external formalization, or Lean kernel check.
Preserved source-review qualifications: both prime chain asymptotic questions open; pinned fc sorry. See the immutable 128-case critical review record for the complete source-return caveats.
What remains
Formalize the quantifier separation: for every prime chain vs exists one prime chain. Derive from a precisely stated hypothetical prime-in-AP bound a recurrence for log p_k and the desired upper growth, carefully tracking the indexing. Verify finite chain fixtures. Acceptance requires exact hypotheses and proof, not a probabilistic heuristic.
Sources and claim boundaries
Maintained #695; https://www.erdosproblems.com/695 ; https://github.com/google-deepmind/formal-conjectures/blob/85f863718beeec7b58a3a1926ee92e3472bc2020/FormalConjectures/ErdosProblems/695.lean ; original [Er79e] and FKL10 papers not independently inspected. Authenticated original source issue. Full historical source theorem pages and external compiled Lean dependencies not all independently inspected. No new result, protected publication, browser MathJax verification or V2 admission.
Editorial source decision: R9 critical review, REVIEWED as a source-grounded explanation only. All open mathematical questions, primary-proof fidelity obligations, and external formalization caveats remain separate.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #1966 — 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.