Skip to content

Erdős problem 1142

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

Sources

Browse retained paths and inspect the exact material available for this Problem.

10 retained statements2415f78e850a

Open selected source

FormalConjectures/ErdosProblems/

1142.lean

Retained formal statement6 of 10

4545 satisfies the Erdős 1142 property: 452=4345 - 2 = 43, 454=4145 - 4 = 41, 458=3745 - 8 = 37, 4516=2945 - 16 = 29, 4532=1345 - 32 = 13.

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

Search problems.science

Find a Problem, Result, source, or page