Skip to content

Erdős problem 851

Let ϵ>0\epsilon > 0. Is there some r≪ϵ1r \ll_\epsilon 1 such that the density of integers of the form 2k+n2^k+n, where k≥0k \geq 0 and nn has at most rr prime divisors, is at least 1−ϵ1-\epsilon?

Erdős Problems records this as proved.

No Repository has ruled on it here.

How far the record reaches4 of 6 stages
  1. Sourceerdos-problems
  2. StatementRetained
  3. Formal2 retained
  4. Resolutionproved
  5. WorkNone recorded
  6. DecisionNone here
  7. The questionNot reached
What this record is missingWork

Nothing here has checked that finding.

Reproducing it here turns a report into evidence.

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