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 statement3 of 10

$15$ satisfies the Erdős 1142 property: $15 - 2 = 13$ , $15 - 4 = 11$ , $15 - 8 = 7$ .

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

1Erdos1142.Erdos1142Prop 15

TestStatement only, no proof