Riesel Sieve
From Wikipedia, the free encyclopedia
 |
The tone or style of this article or section may not be appropriate for Wikipedia. Specific concerns may be found on the talk page. See Wikipedia's guide to writing better articles for suggestions.(December 2007) |
Riesel Sieve is a distributed computing project, running in part on the BOINC platform. Its aim is to prove that 509203 is the smallest Riesel number, by finding a prime of the form k · 2n−1 for all odd k smaller than 509203.
[edit] Progress of the project
At the start of the project, there were 101 k less than 509203 for which no prime k · 2n−1 was known. As of May 2007, more than thirty of these k had been eliminated; the largest prime found by this project by May 2007 is 342673 · 22639439−1 of 794556 digits, and it is known that for none of the remaining k is there a prime with n < 2 million.
The project proceeds in the same way as other prime-hunting projects like GIMPS or Seventeen or Bust: sieving eliminates pairs (k, n) with small factors, and then a deterministic test, in this case the Lucas-Lehmer-Riesel test based on the Lucas-Lehmer test, is used to check primality of numbers without small factors. Users can choose whether to sieve or to run LLR tests on candidates sieved by other users; heavily-optimised sieving software is available.
Riesel Sieve maintains lists of the primes that have been found[1] and the k whose status is still unknown.[2]
[edit] References
- ^ Riesel Sieve, Project Prime Finder Hall of Fame.
- ^ Riesel Sieve, Current k Status.
[edit] External links
- The official Riesel Sieve home page.
- Definition and status of the problem
- Riesel Sieve project statistics
|
|||||||||||||||||
