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

1515 satisfies the Erdős 1142 property: 15−2=1315 - 2 = 13, 15−4=1115 - 4 = 11, 15−8=715 - 8 = 7.

FormalConjectures/ErdosProblems/1142.leanErdos1142.erdos_1142.test_151 lineExact file
Erdos1142.Erdos1142Prop 15
TestStatement only, no proof