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

$105$ satisfies the Erdős 1142 property: the largest known example. $105 - 2 = 103$ , $105 - 4 = 101$ , $105 - 8 = 97$ , $105 - 16 = 89$ , $105 - 32 = 73$ , $105 - 64 = 41$ .

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

1Erdos1142.Erdos1142Prop 105

TestStatement only, no proof

Sources

Search problems.science