Skip to content

Erdős problem 891

Let 2=p1<p2<⋯2=p_1 < p_2 < \cdots be the primes and k≥2k\geq 2. Is it true that, for all sufficiently large nn, there must exist an integer in [n,n+p1⋯pk)[n,n+p_1\cdots p_k) with >k>k many prime factors?

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.