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?

How the state got here

0 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingNothing recorded here
  6. Next gapNot recorded

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:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:9b88648170dbf7cff6380d19646ff778c77f55a809b959c9b5c678765bbfd9c2
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb