Riesel problem 2

The 2nd Riesel problem involves determining the smallest Riesel numbers k•2ⁿ-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	0	18,050
1	2	3	108,698	0	27,596
2	4	7	81,102	0	30,503
3	8	15	50,599	0	23,785
4	16	31	26,814	0	13,631
5	32	63	13,183	0	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	0	?
17	131,072	∞	?	0	?

Riesel primes

Base = 2 :

Miscellaneous

Riesel prime Riesel problem 1 Riesel problem 2 Riesel problem 3 Riesel problem 4 Riesel numbers Least n (k≤12)

Tables

1-300 300-2000 2000-4000 4000-6000 6000-8000 8000-10000 104-105 105-106 106-107 107-108 108-109 109-1010 1010-∞

Categories

1-300 300-2000 2000-4000 4000-6000 6000-8000 8000-10000 104-105 105-106 106-107 107-108 108-109 109-1010 1010-∞

Others

3k 15k 2145k 2805k 0 primes 100+ primes Riesel numbers Missing ranges

Other categories

Missing ranges Low weight No Sophie Germain No twin Count 0 Constant n

Other bases

3 4 5 10 16 128 263 284