| Currently there may be errors shown on top of a page, because of a missing Wiki update (PHP version and extension DPL3). |
| Topics | Help • Register • News • History • How to • Sequences statistics • Template prototypes |
Difference between revisions of "Sierpiński-Riesel Base 5"
m |
m (Karbon moved page Sierpinski-Riesel Base 5 to Sierpiński-Riesel Base 5 without leaving a redirect: name) |
(No difference)
| |
Revision as of 11:04, 20 February 2019
The Sierpiński-Riesel Base 5 Project is a distributed computing project. It is managed by users of mersenneforum.org.
Goal
Sierpiński-Riesel Base 5 tries to prove that k=159986 is the smallest possible Sierpiński number base 5 and that k=346802 is the smallest possible Riesel number base 5. To prove this, one must find primes for all k below the smallest known number.
How to participate
Participants in either of the projects reserve a k in the forum, then use NewPGen to sieve and then LLR to PRP test (for primality). After that, users unreserve their k again if no primes are found. Instructions to the project can be found at OmbooHankvalds guidepages.
Status
As of this moment (2006-10-18), there are 80 Sierpiński and 206 Riesel base 5 candidate k left, which need primes.
Results
Primes from the project can be seen on the status-page of either the Sierpińskis or the Riesels.
