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 "Riesel Prime Search"

From Prime-Wiki
Jump to: navigation, search
(navbox)
(Adding variable templates and category)
 
Line 2: Line 2:
  
 
The project description is as follows:
 
The project description is as follows:
:The project is searching for Riesel primes k*2^n-1, k>1.
+
:The project is searching for [[Riesel prime]]s {{Kbn|k|n}}, {{Vk}} > 1.
 
:We have three subprojects as follows.
 
:We have three subprojects as follows.
::(1) k's that can produce many primes in the given range of exponent n
+
:# {{Vk}}-values that can produce many primes in the given range of exponent {{Vn}}
::(2) low-weight k's that produce a very small number of primes (opposite to (1) above)
+
:# Low-weight {{Vk}}-values 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).
+
:# Small {{Vk}} < 300 (with exception of those {{Vk}}-values already reserved by other projects)
  
 
==External links==
 
==External links==
*[http://www.mersenneforum.org/showthread.php?t=4917 Project at MersenneForum]
+
*[https://www.mersenneforum.org/forumdisplay.php?f=59 Project forum 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]
 +
 
{{Navbox Riesel Prime Search}}
 
{{Navbox Riesel Prime Search}}
 
{{Navbox Projects}}
 
{{Navbox Projects}}
 +
 
[[Category:Riesel Prime Search| ]]
 
[[Category:Riesel Prime Search| ]]
 +
[[Category:Distributed computing project]]

Latest revision as of 20:24, 7 March 2024

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•2n-1, k > 1.
We have three subprojects as follows.
  1. k-values that can produce many primes in the given range of exponent n
  2. Low-weight k-values that produce a very small number of primes (opposite to (1) above)
  3. Small k < 300 (with exception of those k-values already reserved by other projects)

External links

Riesel Prime Search
Projects