Skip to content

Erdős problem 1209

Let A={a1<a2<⋯ }A=\{a_1<a_2<\cdots\} be a sequence of integers which tends to infinity sufficiently fast. If there is an nn such that all n+akn+a_k are primes then must there exist infinitely many such nn?

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

Retained declaration

FormalConjectures/ErdosProblems/1209.lean

Formal Conjectures

FormalConjectures/ErdosProblems/1209.leanErdos1209.erdos_1209.parts.i5 linesExact file
False ↔  ∃ f,    ∀ (a : ℕ → ℕ),      StrictMono a →        (∀ (k : ℕ), f k ≤ a k) → (∃ n, ∀ (k : ℕ), Nat.Prime (n + a k)) → {n | ∀ (k : ℕ), Nat.Prime (n + a k)}.Infinite
SolvedStatement only, no proof

Reported activity

Work these sources record against this Problem. Source-reported attribution, not reviewed here.

  • AI collaborating with humans

    Erdős AI contributions wiki · 15 Apr, 2026

    Machine
    GPT-5.4 Pro
    People
    Enrique Barschkis
    Open the source record

Continue

Start a contributionBrowse the source filesOpen the collection entry

Search problems.science

Find a Problem, Result, source, or page