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

Riesel Prime Search

From Prime-Wiki
Revision as of 15:18, 3 July 2024 by Gd barnes (talk | contribs) (correct prime count)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

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)

Drive overview

Drive Start End #k k-range n-range #primes Purpose
Drive 1 2005-10-31 2006-08-02 16 67342275 - 3467560635 201700 - 400000 103 new / - confirmed Riesel primes for high weighted k's
Drive 2 2006-03-18 2006-08-13 20 107 - 239 210000 - 600000 56 new / 5 confirmed Riesel primes for k's < 300
Drive 3 2006-04-27 2009-03-01 36 389152177 - 857656417 1105000 - 2000000 - new / - confirmed Riesel primes for low weighted k's
Drive 4 2006-07-28 2006-12-16 21 91 - 299 various - 600000 35 new / - confirmed Riesel primes for k's
Drive 5 2006-11-12 2008-07-04 14 51 - 291 various - 1000000 57 new / 4 confirmed Riesel primes for k's < 300 divisible by 3
Megabit 2 2011-04-28 2022-04-10 30 115 - 193 1000000 - 2300000 50 new / - confirmed Riesel primes for k's < 300
k=5 2007-10-03 2021-09-17 1 5 470000 - 6000000 4 new / - confirmed Riesel primes for k = 5

External links

Riesel Prime Search
Projects