Information as of 2020-03-29: Collecting data or work done for Riesel primes k<300

Difference between revisions of "Riesel Prime Search"

From Prime-Wiki
Jump to: navigation, search
m
(cat. changed)
 
Line 11: Line 11:
 
*[http://www.mersenneforum.org/showthread.php?t=4917 Project at MersenneForum]
 
*[http://www.mersenneforum.org/showthread.php?t=4917 Project at MersenneForum]
 
*[https://primes.utm.edu/bios/page.php?id=819 Project at The Prime Pages]
 
*[https://primes.utm.edu/bios/page.php?id=819 Project at The Prime Pages]
[[Category:Distributed computing project]]
+
[[Category:Riesel Prime Search| ]]

Latest revision as of 15:02, 17 February 2020

Riesel Prime Search (RPS) is a prime searching project established in 2005 by Predrag Minovic (Kosmaj).

The project description is as follows:

The project is searching for Riesel primes k*2^n-1, k>1.
We have three subprojects as follows.
(1) k's that can produce many primes in the given range of exponent n
(2) low-weight k's that produce a very small number of primes (opposite to (1) above)
(3) small k < 300 (with exception of those k's already reserved by other projects).

External links