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?

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:b264734618fca571bd985c187f3ed7ac813faf92f7445b551cad6ea85217c241
Metadata
sha256:d3400e262fab0db45fc6acfd21d3239c913df05fedc9dfc2c95fab3742a78641
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:9b88648170dbf7cff6380d19646ff778c77f55a809b959c9b5c678765bbfd9c2
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page