Erdős problem 1142 · problems.science

Are there infinitely many $n > 2$ such that $n - 2^k$ is prime for all $k \geq 1$ with $2^k < n$ ?

No current result

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

FormalConjectures/ErdosProblems/1142.lean

Formal Conjectures

FormalConjectures/ErdosProblems/1142.leanErdos1142.erdos_11421 lineExact file

1sorry ↔ Infinite ↑{n | Erdos1142.Erdos1142Prop n}

OpenStatement only, no proof