Erdős Problem #891 — Let 2=p_1<p_2<… be the primes and k≥ 2. Is it true that, for all sufficiently large n, there must exist an integer in [n,n+p_1… p_k) with >k many prime factors?
Statement
Let be the primes and . Is it true that, for all sufficiently large , there must exist an integer in with many prime factors?
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.