Skip to content

Erdős problem 1142

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

Sources

The source's own material, retained exactly.

10 retained statements36c6d0fef71a

Open selected source

FormalConjectures/ErdosProblems/

1142.lean

Retained formal statement10 of 10

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

FormalConjectures/ErdosProblems/1142.leanErdos1142.erdos_1142.variants.mientka_weitzenkamp1 lineExact file
{n | n ≤ 2 ^ 44 ∧ Erdos1142.Erdos1142Prop n} = {4, 7, 15, 21, 45, 75, 105}
SolvedStatement only, no proof