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)
m
 
(5 intermediate revisions by 3 users not shown)
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 formerly managed by users of mersenneforum.org, and is currently a subproject on [[PrimeGrid]].
  
 
==Goal==
 
==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.
+
Sierpiński-Riesel Base 5 tries to prove that {{Vk}}=159986 is the smallest possible [[Sierpiński number base 5]] and that {{Vk}}=346802 is the smallest possible [[Riesel number base 5]]. To prove this, one must find primes for all {{Vk}} below the smallest known number.
  
 
==How to participate==
 
==How to participate==
Participants in either of the projects reserve a ''k'' in the forum, then use [[NewPGen]] to [[sieving|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 [http://www.geocities.com/omboohankvald/SRB5.html OmbooHankvalds guidepages].
+
Participants in either of the projects reserve a {{Vk}} in the forum, then use [[NewPGen]] to [[sieving|sieve]] and then [[LLR]] to PRP test (for primality). After that, users unreserve their {{Vk}} again if no primes are found. Instructions to the project can be found at [http://www.geocities.com/omboohankvald/SRB5.html OmbooHankvalds guidepages].
  
 
==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.
+
{{C|red|The correct countings are shown only if every {{Vk}}-value has its own page.}}
 +
*[[PrimeGrid Riesel base 5]]: There are <b>{{#expr:{{PAGESINCATEGORY:PrimeGrid Riesel base 5}}-1}}</b> values to prove.
 +
*[[PrimeGrid Sierpiński base 5]]: There are <b>{{#expr:{{PAGESINCATEGORY:PrimeGrid Sierpiński base 5}}-1}}</b> values to prove.
  
 
==Results==
 
==Results==
Primes from the project can be seen on the status-page of either the [http://www.geocities.com/base5_sierpinski_riesel/Sierpinski/status.txt Sierpińskis] or the [http://www.geocities.com/base5_sierpinski_riesel/Riesel/status.txt Riesels].
 
  
 
==External links==
 
==External links==
Line 18: Line 19:
 
*[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]]

Latest revision as of 11:42, 5 October 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.

Results

External links