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?
Retained from Formal Conjectures · not edited here
Formal statements
3 open · 1 solved
Erdős Problems says
open
Decision here
No current contribution
Checks
0 checks · 4 formal

Current Result

Accepted in Vela Mathematics Program

Current Result

No result has been accepted here yet.

Type
Evidence
0 artifacts
Decision
None
Reviewed
No date retained

Search problems.science

Find a Problem, Result, source, or page