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$ ?

Sources

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

10 retained statements2415f78e850a

FormalConjectures/ErdosProblems/

1142.lean

Retained formal statement1 of 10

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

The only known such $n$ are $4, 7, 15, 21, 45, 75, 105$ (OEIS [A039669](https://oeis.org/A039669)).

FormalConjectures/ErdosProblems/1142.leanErdos1142.erdos_11421 lineExact file

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

OpenStatement only, no proof