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

7575 satisfies the Erdős 1142 property: 75−2=7375 - 2 = 73, 75−4=7175 - 4 = 71, 75−8=6775 - 8 = 67, 75−16=5975 - 16 = 59, 75−32=4375 - 32 = 43, 75−64=1175 - 64 = 11.

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