| 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"
(restored) |
(interwiki links) |
||
| Line 1: | Line 1: | ||
| − | '''Riesel Prime Search''' (RPS) is a prime searching project established in 2005 by Predrag Minovic (Kosmaj). | + | '''Riesel Prime Search''' (RPS) is a prime searching project established in 2005 by [[Predrag_Minovic|Predrag Minovic]] (Kosmaj). |
The project description is as follows: | The project description is as follows: | ||
Revision as of 14:31, 14 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).
