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 |
The 2nd Riesel Problem
The 2nd Riesel problem involves determining the smallest Riesel numbers k•2n-1 for 509203 < k < 762701, the first and second Riesel k-values without any possible primes.
m | nmin | nmax | remain | current | target |
---|---|---|---|---|---|
12 | 4,096 | 8,191 | ? | 0 | ? |
Riesel primes
Base = 2 : |
Miscellaneous |
Tables |
Categories |
Others |
Other categories |
Other bases |