Grimm's Conjecture

Conjecture
Suppose $\left[{n+1,n+2,\ldots,n+k}\right]$ are all composite numbers.

Then, there exists a set $\left[{p_i}\right]$ of $k$ distinct primes such that each $p_i$ divides $n+i$ for all $1\le{i}\le{k}$