Erdős problem 1209 · problems.science

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

Browse retained paths and inspect the exact material available for this Problem.

6 retained statements2415f78e850a

Open selected source

FormalConjectures/ErdosProblems/

1209.lean

Retained formal statement5 of 6

Are there $n$ such that $n+2^{2^k}$ is infinitely often a prime?

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

1True ↔ ∃ n, {k | Nat.Prime (n + 2 ^ 2 ^ k)}.Infinite

OpenStatement only, no proof

Sources

Search problems.science