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

Mientka and Weitzenkamp [MiWe69] proved that the only $n \leq 2^{44}$ such that $n > 2$ and $n - 2^k$ is prime for all $k \geq 1$ with $2^k < n$ are $4, 7, 15, 21, 45, 75, 105$ .

FormalConjectures/ErdosProblems/1142.leanErdos1142.erdos_1142.variants.mientka_weitzenkamp1 lineExact file

1{n | n ≤ 2 ^ 44 ∧ Erdos1142.Erdos1142Prop n} = {4, 7, 15, 21, 45, 75, 105}

SolvedStatement only, no proof

Sources

Search problems.science