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?

Nothing has been recorded here yet.

How far the record reaches3 of 6 stages
  1. Sourceerdos-problems
  2. StatementRetained
  3. Formal10 retained
  4. ResolutionNone filed
  5. WorkNone recorded
  6. DecisionNone here
  7. The questionNot reached
What this record is missingResolution

No source retained here records an outcome for this question.

Its collection still marks it open.

Where the source files it579 share a topic
Erdős problem 321accepted
Carrying a Standing. Browse the topic.