Erdős problem 1142 · problems.science

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

Result history

Published changes, performers, checks, and later corrections.

No result history yet

No proposed change is retained for this Problem, so there is nothing to show a decision on.

No correction history

Technical detailsExact roots, source, and retained record identifiers

Problem row: sha256:54fdbd8c42b21ef5449a9e03063ab6fc0a87e16a92e93df82c6adb6d221e7b25
Metadata: sha256:159778fd45d848717be861a897a61dd2200f401f572a22c355f2cd48139dfe04
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:b41032155510841220e74768f33c383c475bb92e4b998108e37b0ca22a23283d

Repository: sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection: sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit: 2415f78e850aeee50afdca525c6f2e0ea606f207