| 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"
(automated countings and broken links) |
m (→Status: Clarification on wording) |
||
| Line 8: | Line 8: | ||
==Status== | ==Status== | ||
| − | {{C|red|The correct countings are shown if | + | {{C|red|The correct countings are shown only if every k-value has its own page.}} |
*[[PrimeGrid Riesel base 5]]: There are <b>{{#expr:{{PAGESINCATEGORY:PrimeGrid Riesel base 5}}-1}}</b> values to prove. | *[[PrimeGrid Riesel base 5]]: There are <b>{{#expr:{{PAGESINCATEGORY:PrimeGrid Riesel base 5}}-1}}</b> values to prove. | ||
*[[PrimeGrid Sierpinski base 5]]: There are <b>{{#expr:{{PAGESINCATEGORY:PrimeGrid Sierpinski base 5}}-1}}</b> values to prove. | *[[PrimeGrid Sierpinski base 5]]: There are <b>{{#expr:{{PAGESINCATEGORY:PrimeGrid Sierpinski base 5}}-1}}</b> values to prove. | ||
Revision as of 15:20, 24 September 2020
The Sierpiński-Riesel Base 5 Project is a distributed computing project. It was formerly managed by users of mersenneforum.org, and is currently a subproject on PrimeGrid.
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
The correct countings are shown only if every k-value has its own page.
- PrimeGrid Riesel base 5: There are 52 values to prove.
- PrimeGrid Sierpinski base 5: There are -1 values to prove.
