Riesel Prime 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*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

• Project at MersenneForum
• Project at The Prime Pages

Riesel Prime Search

Miscellaneous

Main

Current work

Megabit Drive‎ 1

Completed

Drive 1 Drive 2 Drive 3 Drive 4 Drive 5 Drive 6 Drive 7 Drive 8 Drive 9 Drive 10 Drive 11 Drive 12 Megabit Drive‎ 2 Megabit Drive‎ 3

Individual k-searches

k=5 k=15 k=17

Others

Projects

Ongoing

Great Internet Mersenne Prime Search (GIMPS) PrimeGrid (PG) Lone Mersenne Hunters (LMH) Riesel Prime Search (RPS) No Prime Left Behind (NPLB) Conjectures 'R Us (CRUS) Twin Prime Search (TPS) Home Prime Search Cunningham project

Terminated

Seventeen or Bust The Other Prime Search (TOPS)