Skip to content

Erdős problem 887

Is there an absolute constant KK such that, for every C>0C > 0, if nn is sufficiently large then nn has at most KK divisors in (n12,n12+Cn14)(n^{\frac{1}{2}}, n^{\frac{1}{2}} + C n^{\frac{1}{4}}).

Nothing has been recorded here yet.

How far the record reaches3 of 6 stages
  1. Sourceerdos-problems
  2. StatementRetained
  3. Formal4 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 it575 share a topic
Erdős problem 321accepted
Carrying a Standing. Browse the topic.