0
![Code Golf](//cdn.sstatic.net/Sites/codegolf/Img/apple-touch-icon.png)
Grimm's conjecture states that, for any set of consecutive composite numbers \$n+1, n+2, ..., n+k\$, there exist \$k\$ distinct primes \$p_i\$, such that \$p_i\$ divides \$n+i\$ for each \$1 \le i \le k\$.
For example, take \$\{24, 25, 26, 27, 28\}\$. We can see that if we take the primes \$2, 5,...