Erdős problem 1142

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

Sources

The source's own material, retained exactly.

10 retained statements36c6d0fef71a

FormalConjectures/ErdosProblems/

1142.lean

Retained formal statement5 of 10

$4$ satisfies the Erdős 1142 property: $4 - 2 = 2$ is prime.

FormalConjectures/ErdosProblems/1142.leanErdos1142.erdos_1142.test_41 lineExact file

1Erdos1142.Erdos1142Prop 4

TestStatement only, no proof