Note: Due to changes in the Riesel prime template, most of those pages (and related) are not shown properly.
This will take some time!
Wanna help? Please move any Riesel prime page first, then edit/add the base parameter.
Navigation
Topics Register • News • History • How to • Sequences statistics • Template prototypes

The 2nd Riesel Problem

From Prime-Wiki
Jump to: navigation, search

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.

 
 : completely included in Prime-Wiki
m nmin nmax remain current target
0 1 1 126,748 2 18,050
1 2 3 108,698 2 27,596
2 4 7 81,102 3 30,503
3 8 15 50,599 0 23,785
4 16 31 26,814 1 13,631
5 32 63 13,183 1 6,613
6 64 127 6,570 0 3,108
7 128 255 3,462 0 1,485
8 256 511 1,977 0 774
9 512 1,023 1,203 0 422
10 1,024 2,047 781 0 228
11 2,048 4,095 553 0 172
12 4,096 8,191 381 110 110
13 8,192 16,383 271 66 66
14 16,384 32,767 205 68 68
15 32,768 65,535 137 29 29
16 65,536 131,071 108 26 26
17 131,072 262,143 82 13 13
18 262,144 524,287 69 16 16
19 524,288 1,048,575 53 11 11
20 1,048,576 42 4 ?
unknown 1,500,000 38 38 -

The current nmax = 1,500,000 as of 2021-07-21.

Riesel primes