Skip to content

Erdős problem 891

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

Workspace

Open this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.

Canvas

public preview
  1. Source#891
  2. ResultNone
  3. Checks0

Search problems.science

Find a Problem, Result, source, or page