The goal of RieselSieve is to find the smallest odd k such that k*2^n-1 is composite for all natural numbers n. The problem of finding such a k is known as the Riesel problem.
Search RieselSieve Users
RieselSieve Primes
| Prime | Digits | Type | Discovered | URL |
|---|---|---|---|---|
| 485767*2^3609357-1 | 1,086,531 | June 24, 2008 | more info | |
| 113983*2^3201175-1 | 963,655 | May 1, 2008 | more info |