Riesel Sieve/en
Zur Navigation springen
Zur Suche springen
 The goal is to implement the prime testing software used by the Riesel Sieve Project under the BOINC system. The project's goal is to prove that 509203 is the smallest odd k where for every n >= 1, k*2^n-1 is composite. Currently, 70 of the original 101 k's that were left when Riesel Sieve started remain. Primality testing is being done on n values around 2.3 million right now, or 650000-700000 digits. The project was integraded in Primegrid in March 2010. |
| |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
