Skip to content

Erdős problem 236

Start work

Let f(n)f(n) count the number of solutions to n=p+2kn=p+2^k for prime pp and k≥0k\geq 0. Show that f(n)=o(log⁡n)f(n)=o(\log n).

Nothing has been recorded here yet.

How far the record reaches3 of 6 stages
  1. Sourceerdos-problems
  2. StatementRetained
  3. Formal1 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.

Open the source record
Where the source files it579 share a topic
Number Theory576Primes61
Erdős problem 321accepted
Carrying a Standing. Browse the topic.
Start workOpen sources