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

$106$ does not satisfy the Erdős 1142 property ( $106 - 2 = 104 = 8 \times 13$ ).

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

1¬Erdos1142.Erdos1142Prop 106

TestStatement only, no proof