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?
Retained from Formal Conjectures · not edited here
Formal statements
1 open · 1 solved · 8 test
Erdős Problems says
open
Decision here
No current contribution
Checks
0 checks · 10 formal

Current Result

Accepted in Vela Mathematics Program

Current Result

No result has been accepted here yet.

Type
Evidence
0 artifacts
Decision
None
Reviewed
No date retained

Search problems.science

Find a Problem, Result, source, or page