Currently there may be errors shown on top of a page, because of a missing Wiki update (PHP version and extension DPL3). |
Topics | Help • Register • News • History • How to • Sequences statistics • Template prototypes |
Difference between revisions of "Riesel problem 1"
(MR) |
(Another k eliminated by Ryan Propper (count will be updated once last assignments are finished by PrimeGrid and multi-reservation is removed)) |
||
(7 intermediate revisions by 3 users not shown) | |||
Line 1: | Line 1: | ||
+ | {{DISPLAYTITLE:Riesel problem, {{Kbn|-|k|2|n}}, {{Vk}} < {{Num|509203}}}} | ||
The '''Riesel problem''' involves determining the smallest [[Riesel number]]. | The '''Riesel problem''' involves determining the smallest [[Riesel number]]. | ||
Line 5: | Line 6: | ||
It is conjectured that this {{Vk}} is the smallest such number that has this property. To prove this, it suffices to show that there exists a value {{Vn}} such that {{Kbn|k|2|n}} is prime for each {{Vk}} < {{Num|509203}}. | It is conjectured that this {{Vk}} is the smallest such number that has this property. To prove this, it suffices to show that there exists a value {{Vn}} such that {{Kbn|k|2|n}} is prime for each {{Vk}} < {{Num|509203}}. | ||
− | Currently, there are '''{{#expr:{{PAGESINCATEGORY: | + | Currently, there are '''{{#expr:{{PAGESINCATEGORY:Riesel problem 1|pages|R}}-2}}''' {{Vk}}-values smaller than {{Num|509203}} that have no known prime. These are reserved by the [[PrimeGrid The Riesel Problem|PrimeGrid Riesel Problem]] search. |
==Frequencies== | ==Frequencies== | ||
===Definition=== | ===Definition=== | ||
− | Let {{V|f<sub>m</sub>}} define the number of {{Vk}}-values ({{Vk}} < {{Num|509203}}, odd {{Vk}}, {{Num|254601}} candidates) with a first prime of {{Kbn|k|2|n}} with {{Vn}} in the interval 2<sup>{{V|m}}</sup> ≤ {{Vn}} < 2<sup>{{V|m}}+1</sup> <ref>[http://www.prothsearch.com/rieselprob.html Riesel problem] by [[Wilfrid Keller]]</ref> | + | Let {{V|f<sub>m</sub>}} define the number of {{Vk}}-values ({{Vk}} < {{Num|509203}}, odd {{Vk}}, {{Num|254601}} candidates) with a first prime of {{Kbn|k|2|n}} with {{Vn}} in the interval 2<sup>{{V|m}}</sup> ≤ {{Vn}} < 2<sup>{{V|m}}+1</sup>. <ref>[http://www.prothsearch.com/rieselprob.html Riesel problem] by [[Wilfrid Keller]]</ref> |
===Data table=== | ===Data table=== | ||
Line 90: | Line 91: | ||
|- | |- | ||
! scope="row" | [[:Category:Riesel 2 1Intervals23|23]] | ! scope="row" | [[:Category:Riesel 2 1Intervals23|23]] | ||
− | | {{Num|8388608}} || {{Num|16777215}} || 50 | | + | | {{Num|8388608}} || {{Num|16777215}} || 50 || {{PAGESINCATEGORY:Riesel 2 1Intervals23|pages|R}} || ≥ {{PAGESINCATEGORY:Riesel 2 1Intervals23|pages|R}} |
|- | |- | ||
− | ! scope="row" | [[:Category: | + | ! scope="row" | [[:Category:Riesel 2 1Intervals24|24]] |
− | | {{Num| | + | | {{Num|16777216}} || {{Num|33554431}} || ≤ 43 || {{PAGESINCATEGORY:Riesel 2 1Intervals24|pages|R}} || ≥ {{PAGESINCATEGORY:Riesel 2 1Intervals24|pages|R}} |
+ | |- | ||
+ | ! scope="row" | [[:Category:Riesel problem 1|unknown]] | ||
+ | | {{Num|33554432}} || ∞ || {{#expr:{{PAGESINCATEGORY:Riesel problem 1|pages|R}}-2}} || class="color-Done" | 0 || {{#expr:{{PAGESINCATEGORY:Riesel problem 1|pages|R}}-2}} | ||
|} | |} | ||
− | '''The current {{Vn}}<sub>max</sub> = {{Num|{{Multi Reservation:11-NMax}}}} as of {{Multi Reservation:11-Date}}.''' | + | [[:Multi Reservation:11|Multi Reservation 11]]: '''The current {{Vn}}<sub>max</sub> = {{Num|{{Multi Reservation:11-NMax}}}} as of {{Multi Reservation:11-Date}}.''' |
− | The {{Vk}}-values [[Riesel prime 2 2293|2293]], [[Riesel prime 2 93839|93839]], [[Riesel prime 2 192971|192971]] and [[Riesel prime 2 206039|206039]] still have missing ranges to prove the smallest {{Vn}}-value and therefore not possible to fill in more values for {{OEIS|l|A108129}}. | + | The {{Vk}}-values [[Riesel prime 2 2293|2293]], [[Riesel prime 2 93839|93839]], [[Riesel prime 2 97139|97139]], [[Riesel prime 2 107347|107347]], [[Riesel prime 2 192971|192971]] and [[Riesel prime 2 206039|206039]] still have missing ranges to prove the smallest {{Vn}}-value and therefore not possible to fill in more values for {{OEIS|l|A108129}}. |
==Notes== | ==Notes== | ||
Line 111: | Line 115: | ||
{{Navbox Riesel primes}} | {{Navbox Riesel primes}} | ||
− | [[Category: | + | [[Category:Riesel prime conjectures|1]] |
[[Category:Riesel 2 1Intervals| ]] | [[Category:Riesel 2 1Intervals| ]] | ||
+ | [[Category:Riesel problem 1| ]] |
Latest revision as of 00:28, 25 August 2024
The Riesel problem involves determining the smallest Riesel number.
Contents
Explanations
In 1956, Hans Riesel showed that there are an infinite number of integers k such that k•2n-1 is not prime for any integer n. He showed that the number k = 509,203 has this property. It is conjectured that this k is the smallest such number that has this property. To prove this, it suffices to show that there exists a value n such that k•2n-1 is prime for each k < 509,203.
Currently, there are 41 k-values smaller than 509,203 that have no known prime. These are reserved by the PrimeGrid Riesel Problem search.
Frequencies
Definition
Let fm define the number of k-values (k < 509,203, odd k, 254,601 candidates) with a first prime of k•2n-1 with n in the interval 2m ≤ n < 2m+1. [1]
Data table
The following table shows the current available k-values in this Wiki and the targeted values shown by W.Keller for any m ≤ 23.
m | nmin | nmax | remain | current | target |
---|---|---|---|---|---|
0 | 1 | 1 | 254,601 | 533 | 39,867 |
1 | 2 | 3 | 214,734 | 628 | 59,460 |
2 | 4 | 7 | 155,274 | 490 | 62,311 |
3 | 8 | 15 | 92,963 | 304 | 45,177 |
4 | 16 | 31 | 47,786 | 139 | 24,478 |
5 | 32 | 63 | 23,308 | 64 | 11,668 |
6 | 64 | 127 | 11,640 | 35 | 5,360 |
7 | 128 | 255 | 6,280 | 32 | 2,728 |
8 | 256 | 511 | 3,552 | 19 | 1,337 |
9 | 512 | 1,023 | 2,215 | 23 | 785 |
10 | 1,024 | 2,047 | 1,430 | 89 | 467 |
11 | 2,048 | 4,095 | 963 | 44 | 289 |
12 | 4,096 | 8,191 | 674 | 191 | 191 |
13 | 8,192 | 16,383 | 483 | 125 | 125 |
14 | 16,384 | 32,767 | 358 | 87 | 87 |
15 | 32,768 | 65,535 | 271 | 62 | 62 |
16 | 65,536 | 131,071 | 209 | 38 | 38 |
17 | 131,072 | 262,143 | 171 | 35 | 35 |
18 | 262,144 | 524,287 | 136 | 25 | 25 |
19 | 524,288 | 1,048,575 | 111 | 22 | 22 |
20 | 1,048,576 | 2,097,151 | 89 | 18 | 18 |
21 | 2,097,152 | 4,194,303 | 71 | 13 | 13 |
22 | 4,194,304 | 8,388,607 | 58 | 8 | 8 |
23 | 8,388,608 | 16,777,215 | 50 | 7 | ≥ 7 |
24 | 16,777,216 | 33,554,431 | ≤ 43 | 2 | ≥ 2 |
unknown | 33,554,432 | ∞ | 41 | 0 | 41 |
Multi Reservation 11: The current nmax = 15,942,000 as of 2024-08-24.
The k-values 2293, 93839, 97139, 107347, 192971 and 206039 still have missing ranges to prove the smallest n-value and therefore not possible to fill in more values for sequence A108129 in OEIS.
Notes
See also
External links
Base = 2 : |
Miscellaneous |
Tables |
Categories |
Others |
Other categories |
Other bases |