Currently there may be errors shown on top of a page, because of a missing Wiki update (PHP version and extension DPL3).
Navigation
Topics Help • Register • News • History • How to • Sequences statistics • Template prototypes

Difference between revisions of "Sierpiński-Riesel Base 5"

From Prime-Wiki
Jump to: navigation, search
m (Karbon moved page Sierpinski-Riesel Base 5 to Sierpiński-Riesel Base 5 without leaving a redirect: name)
(update status and links)
Line 1: Line 1:
The '''Sierpiński-Riesel Base 5 Project''' is a [[distributed computing project]]. It is managed by users of mersenneforum.org.
+
The '''Sierpiński-Riesel Base 5 Project''' is a [[distributed computing project]]. It was formally managed by users of mersenneforum.org, and is currently a subproject on [[PrimeGrid]].
  
 
==Goal==
 
==Goal==
Line 8: Line 8:
  
 
==Status==
 
==Status==
As of this moment (2006-10-18), there are 80 Sierpiński and 206 Riesel base 5 candidate k left, which need primes.
+
As of this moment (2019-04-23), there are 32 Sierpiński and 69 Riesel base 5 candidate k left, which need primes.
  
 
==Results==
 
==Results==
Line 18: Line 18:
 
*[http://mersenneforum.org/showthread.php?t=3754 Riesel reservation thread]
 
*[http://mersenneforum.org/showthread.php?t=3754 Riesel reservation thread]
 
*[http://www.distributedcomputing.info/ap-math.html#rieselbase5 distributedcomputing.info entry]
 
*[http://www.distributedcomputing.info/ap-math.html#rieselbase5 distributedcomputing.info entry]
 +
*[https://www.primegrid.com/forum_forum.php?id=93 PrimeGrid forum]
 
[[Category:Distributed computing project]]
 
[[Category:Distributed computing project]]

Revision as of 20:09, 23 April 2019

The Sierpiński-Riesel Base 5 Project is a distributed computing project. It was formally 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

As of this moment (2019-04-23), there are 32 Sierpiński and 69 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.

External links