Erdős problem 1209

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

Sources

The source's own material, retained exactly.

6 retained statements36c6d0fef71a

FormalConjectures/ErdosProblems/

1209.lean

Retained formal statement4 of 6

Are there $n$ such that $n+2^{2^k}$ is always squarefree?

FormalConjectures/ErdosProblems/1209.leanErdos1209.erdos_1209.parts.iii.b1 lineExact file

1True ↔ ∃ n, ∀ (k : ℕ), Squarefree (n + 2 ^ 2 ^ k)

OpenStatement only, no proof