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 |
Search results
Create the page "Riesel k=Riesel" on this wiki! See also the search results found.
- ...2}</math>, where <math>S_0=4</math> and for <math>k>0</math>, <math>S_k=S_{k-1}^2-2</math>. * [[Riesel prime 2 1|Riesel primes for k=1]]5 KB (857 words) - 14:53, 19 September 2021
- ...]] in search for lowest [[Sierpiński number|Sierpiński]]/[[Riesel number|Riesel]] values.}} ...t '[[Sierpiński number|Sierpiński value]]' (+1 form) or '[[Riesel number|Riesel value]]' (-1 form) that is composite for all values of {{Vn}} ≥ 1. Conje3 KB (503 words) - 02:20, 1 May 2024
- ...n 2008-01-10. The project searches for [[Riesel prime]]s of the form {{Kbn|k|2|n}} with odd {{Vk}} and 300 < {{Vk}} < 1001 and {{Vn}} > 260000 not reser745 bytes (111 words) - 02:17, 1 May 2024
- Consider numbers of the form {{V|N}} = {{Kbn|+|k|n}}, where {{Vk}} is odd and {{Vn}} > 0. If, for some fixed {{Vk}}, every i *[[Riesel problem 1|Riesel problem]]5 KB (650 words) - 10:25, 26 March 2024
- A '''Riesel number''' is a value of ''k'' such that {{Kbn|k|n}} is always composite for all [[natural number]]s. ...the [[Sierpiński problem]] article, [[Hans Riesel]] found in 1956 that [[Riesel prime 2 509203|{{Kbn|509203|n}}]] is always composite.827 bytes (112 words) - 08:21, 25 March 2024
- *[[LLR|Lucas–Lehmer–Riesel test]]: Used for [[Riesel prime]]s. *[[Proth's theorem]]: Used to test numbers of the form {{Kbn|+|k|n}} with 2<sup>{{Vn}}</sup> > {{Vk}}, making it useful in several [[distrib3 KB (501 words) - 05:20, 3 August 2021
- '''LLR (Lucas Lehmer Riesel)''' is probably the fastest [[Primality testing program|program]] available **[[Lucas-Lehmer-Riesel algorithm]] for {{Kbn|k|n}} numbers.2 KB (300 words) - 22:00, 16 December 2023
- ...F_{n,2}</math> numbers can be proven prime by using [[Pépin's test]] with k=5. ==Björn & Riesel==5 KB (726 words) - 09:57, 12 September 2021
- ...rime Search|Proth Prime Search]]: searching for primes of the form {{Kbn|+|k|2|n}}. ...ed|Proth Prime Search Extended]]: searching for primes of the form {{Kbn|+|k|2|n}}.3 KB (458 words) - 10:28, 26 March 2024
- ...t that looks for large [[twin prime]]s ([[Riesel prime|Riesel type]] {{Kbn|k|n}}) of world record size.826 bytes (100 words) - 11:04, 21 March 2024
- '''Riesel Prime Search''' (RPS) is a prime searching project established in 2005 by [ :The project is searching for [[Riesel prime]]s {{Kbn|k|n}}, {{Vk}} > 1.845 bytes (120 words) - 02:21, 1 May 2024
- ...ial definition of a '''Riesel prime''' mostly all primes of the form {{Kbn|k|n}} with 2<sup>{{Vn}}</sup> > {{Vk}} are called like this on many pages. ...mersenneforum.org/showthread.php?t=29635 "Team drive #1 for {{Vk}}<300: 26 k's for {{Vn}}>2M"]: [https://www.mersenneforum.org/showpost.php?p=655608 #12 KB (279 words) - 03:48, 24 April 2024
- The '''Riesel sieve project (RSP)''' is a [[distributed computing]] project. It is now a ...e to find primes for all the remaining k values to prove that they are not Riesel numbers.2 KB (326 words) - 10:29, 26 March 2024
- :{{V|N}} = {{Kbn|+|k|2|n}} *[[Riesel number]]670 bytes (104 words) - 10:59, 9 July 2021
- ...o ensure validity of [[Proth prime|Proth]] tests and PRP tests on base-2 [[Riesel prime]] candidates, and by those programs and [[PRST]] in an extended versi Let <math>p</math> be a Proth number, and let <math>k</math>, <math>n</math>, and <math>a</math> be defined as on [[Proth's theor3 KB (528 words) - 14:59, 3 October 2023
- A '''Sierpiński number base 5''' is a value of {{Vk}} such that {{Kbn|+|k|5|n}} is always [[composite number|composite]]. ...r not, a [[distributed computing project]] was created named [[Sierpiński-Riesel Base 5]].556 bytes (83 words) - 10:57, 14 October 2020
- A '''Riesel number base 5''' is a value of ''k'' such that {{Kbn|-|k|5|n}} is always a [[composite number]]. Using the same method presented in the [[Riesel problem 1|Riesel problem]] article, it was found that {{Kbn|-|346802|5|n}} is multiple of 3,589 bytes (90 words) - 10:30, 26 March 2024
- {{DISPLAYTITLE:Riesel problem, {{Kbn|-|k|2|n}}, {{Vk}} < {{Num|509203}}}} The '''Riesel problem''' involves determining the smallest [[Riesel number]].6 KB (689 words) - 18:14, 4 April 2024
- '''Tutorial to LLR (Lucas Lehmer Riesel) and PRP:''' The projects [[Prime Sierpiński Project]] and [[Riesel Sieve]] also use [[LLRNET]], which is recommended for people with a perman2 KB (337 words) - 13:24, 20 February 2019
- {{DISPLAYTITLE:Riesel numbers of the form {{Kbn|k|n}} with Nash weight < 1000}} Riesel numbers {{Kbn|k|n}} where the [[Nash weight]] is smaller than 1000.948 bytes (121 words) - 13:08, 21 July 2021
- {{DISPLAYTITLE:Riesel primes of the form {{Kbn|k|b|n}}, least {{Vn}}-values}} ...wn the least {{Vn}} ≥ 1 generating a [[Riesel prime]] of the form {{Kbn|k|b|n}} for 2 ≤ {{Vb}} ≤ 1030 and 2 ≤ {{Vk}} ≤ 12.6 KB (684 words) - 09:40, 17 March 2024
- {{Riesel prime {{HistC|2019|3440042|Rüdiger K. Eckhard}}775 bytes (85 words) - 00:10, 17 July 2021
- {{Riesel prime {{HistF|2017-01-30|3366033|Rüdiger K. Eckhard}}2 KB (208 words) - 02:44, 12 May 2024
- {{Riesel prime {{HistF|1999-06-29|109130|Rüdiger K. Eckhard}}1 KB (133 words) - 05:02, 17 April 2024
- *Name: [[Riesel Prime Search]] Drive 10 *Purpose: The goal of this drive is to search for primes of the form '''{{Kbn|k|n}}''' for '''128 low-weighted {{Vk}}'s with 10000 < {{Vk}} < 35000'''.2 KB (290 words) - 22:54, 10 April 2024
- {{DISPLAYTITLE:Riesel primes of the form {{Kbn|k|n}}, {{Vk}} < 300}} Automatically generated table from available [[:Category:Riesel 2 1-300|Riesel primes {{Vk}} < 300]].855 bytes (117 words) - 07:27, 16 July 2021
- The goal of this drive is to search for primes of the form {{Kbn|k|n}} for {{Vk}} ≤ 300 and {{Vn}} > 1000000. | [[Riesel prime 2 35|35]] || {{GP|Riesel prime 2 35|RNash}} || 12517 || 2520000 - ||4 KB (439 words) - 10:45, 9 May 2024
- The goal of this drive is to search for primes of the form {{Kbn|k|n}} for {{Vk}} ≤ 300 and {{Vn}} > 1000000. | [[Riesel prime 2 115|115]] || {{GP|Riesel prime 2 115|RNash}} || 43318 || 1000000 - || 1141719, 15241834 KB (376 words) - 21:41, 8 May 2024
- The goal of this drive is to search for primes of the form {{Kbn|k|n}} for {{Vk}} ≤ 300 and {{Vn}} > 1400000. | [[Riesel prime 2 203|203]] || {{GP|Riesel prime 2 203|RNash}} || 23371 ||2 KB (155 words) - 07:18, 7 May 2024
- __NOTOC__{{DISPLAYTITLE:Riesel primes of the form {{Kbn|k|n}}, {{Num|10000}} ≤ {{Vk}} ≤ {{Num|25000}}}} *For {{Num|25000}} ≤ {{Vk}} ≤ {{Num|100000}} see [[Riesel 2 10e4-10e5a|here]]1 KB (176 words) - 09:20, 22 July 2021
- {{DISPLAYTITLE:Riesel primes of the form {{Kbn|k|n}}, 4000 < {{Vk}} < 6000}} Automatically generated table from available [[:Category:Riesel 2 4000-6000|Riesel primes 4000 < {{Vk}} < 6000]].883 bytes (117 words) - 08:42, 22 July 2021
- {{DISPLAYTITLE:Riesel primes of the form {{Kbn|k|n}}, 300 < {{Vk}} < 2000}} Automatically generated table from available [[:Category:Riesel 2 300-2000|Riesel primes 300 < {{Vk}} < 2000]].878 bytes (117 words) - 08:27, 22 July 2021
- *Name: [[Riesel Prime Search]] Drive 7 *Purpose: The goal of this drive is to search for primes of the form {{Kbn|k|n}} for 21 high-weighted 2200 < {{Vk}} < 3000.1 KB (123 words) - 03:03, 17 April 2024
- {{DISPLAYTITLE:Riesel primes of the form {{Kbn|k|n}}, 10<sup>5</sup> < {{Vk}} < 10<sup>6</sup>}} Automatically generated table from available [[:Category:Riesel 2 10e5-10e6|Riesel primes 10<sup>5</sup> < {{Vk}} < 10<sup>6</sup>]].1 KB (153 words) - 09:34, 22 July 2021
- {{DISPLAYTITLE:Riesel primes of the form {{Kbn|k|n}}, 10<sup>6</sup> < {{Vk}} < 10<sup>7</sup>}} Automatically generated table from available [[:Category:Riesel 2 10e6-10e7|Riesel primes 10<sup>6</sup> < {{Vk}} < 10<sup>7</sup>]].1 KB (153 words) - 09:46, 22 July 2021
- {{DISPLAYTITLE:Riesel primes of the form {{Kbn|k|n}}, 10<sup>7</sup> < {{Vk}} < 10<sup>8</sup>}} Automatically generated table from available [[:Category:Riesel 2 10e7-10e8|Riesel primes 10<sup>7</sup> < {{Vk}} < 10<sup>8</sup>]].1 KB (153 words) - 09:58, 22 July 2021
- {{DISPLAYTITLE:Riesel primes of the form {{Kbn|k|n}}, 10<sup>8</sup> < {{Vk}} < 10<sup>9</sup>}} Automatically generated table from available [[:Category:Riesel 2 10e8-10e9|Riesel primes 10<sup>8</sup> < {{Vk}} < 10<sup>9</sup>]].1 KB (153 words) - 10:00, 22 July 2021
- {{DISPLAYTITLE:Riesel primes of the form {{Kbn|k|n}}, 10<sup>9</sup> < {{Vk}} < 10<sup>10</sup>}} Automatically generated table from available [[:Category:Riesel 2 10e9-10e10|Riesel primes 10<sup>9</sup> < {{Vk}} < 10<sup>10</sup>]].1 KB (153 words) - 10:05, 22 July 2021
- ==k-values left== *[[PrimeGrid Riesel base 5]]2 KB (245 words) - 11:43, 5 September 2021
- {{Riesel prime {{HistC|2019|1999911|Rüdiger K. Eckhard}}267 bytes (22 words) - 06:58, 19 July 2021
- {{Riesel prime {{HistF|2020-06-12|1573410|Rüdiger K. Eckhard}}979 bytes (92 words) - 06:59, 19 July 2021
- {{Riesel prime {{HistC|2018|2256224|Rüdiger K. Eckhard}}359 bytes (29 words) - 07:00, 19 July 2021
- {{Riesel prime {{HistF|2020-06-12|1580131|Rüdiger K. Eckhard}}401 bytes (31 words) - 07:00, 19 July 2021
- ...he project searched for prime numbers of the form {{Kbn|k|1290000}}, for ''k'' ≤ 10<sup>13</sup>. ...Kbn|k|1290001}} or {{Kbn|k|1289999}}, and Twin pairs take the form {{Kbn|+|k|1290000}}.<ref>[https://www.primegrid.com/forum_thread.php?id=1450&nowrap=t3 KB (337 words) - 15:13, 16 December 2023
- {{DISPLAYTITLE:Riesel primes of the form {{Kbn|k|n}}, 2000 < {{Vk}} < 4000}} Automatically generated table from available [[:Category:Riesel 2 2000-4000|Riesel primes 2000 < {{Vk}} < 4000]].883 bytes (117 words) - 08:39, 22 July 2021
- {{DISPLAYTITLE:Riesel primes of the form {{Kbn|k|n}}, 6000 < {{Vk}} < 8000}} Automatically generated table from available [[:Category:Riesel 2 6000-8000|Riesel primes 6000 < {{Vk}} < 8000]].883 bytes (117 words) - 08:56, 22 July 2021
- {{DISPLAYTITLE:Riesel primes of the form {{Kbn|k|n}}, 8000 < {{Vk}} < 10000}} Automatically generated table from available [[:Category:Riesel 2 8000-10000|Riesel primes 8000 < {{Vk}} < 10000]].888 bytes (117 words) - 09:00, 22 July 2021
- {{DISPLAYTITLE:Riesel primes of the form {{Kbn|k|n}}, {{Vk}} > 10<sup>10</sup>}} ...tically generated table from available [[:Category:Riesel 2 10e10-infinity|Riesel primes {{Vk}} > 10<sup>10</sup>]].1 KB (146 words) - 10:08, 22 July 2021
- *Name: [[Riesel Prime Search]] Drive 9 *Purpose: The goal of this drive is to search for primes of the form {{Kbn|k|n}} for 40 high-weighted 10000 < {{Vk}} < 30000.2 KB (151 words) - 10:56, 11 January 2023
- {{DISPLAYTITLE:Riesel numbers of the form {{Kbn|k|n}}}} '''Riesel numbers''' are odd numbers {{Vk}} for which {{Kbn|k|n}} is composite for all natural numbers {{Vn}}.808 bytes (110 words) - 21:12, 17 December 2023
- {{DISPLAYTITLE:Riesel numbers of the form {{Kbn|k|n}} with 100 and more primes}} Riesel numbers {{Kbn|k|n}} with 100 or more prime values {{Vn}}.911 bytes (120 words) - 21:56, 25 July 2021
- {{DISPLAYTITLE:Riesel numbers of the form {{Kbn|k|n}} with {{Vk}} mod 15 = 0}} Riesel numbers {{Kbn|k|n}} where {{Vk}}-value is a multiple of 15.1 KB (156 words) - 06:59, 16 July 2021
- {{DISPLAYTITLE:Riesel numbers of the form {{Kbn|k|n}} with {{Vk}} mod 2145 = 0}} Riesel numbers {{Kbn|k|n}} where {{Vk}}-value is a multiple of 2145.1 KB (156 words) - 07:01, 16 July 2021
- {{DISPLAYTITLE:Riesel numbers of the form {{Kbn|k|n}} with {{Vk}} mod 2805 = 0}} Riesel numbers {{Kbn|k|n}} where {{Vk}}-value is a multiple of 2805.1 KB (156 words) - 07:08, 16 July 2021
- {{DISPLAYTITLE:Riesel numbers of the form {{Kbn|k|n}} with no prime value so far}} Riesel numbers {{Kbn|k|n}} where no prime values are known.871 bytes (117 words) - 21:46, 25 March 2024
- ...tures regarding the frequency of prime {{Vn}}-values of a given parity for Riesel and Proth {{Vk}}-values divisible by 3. The notion that certain {{Vk}}-valu [[Valery Liskovets]] studied the list of {{Kbn|+|k|n}} primes and observed, that the {{Vk}}'s ({{Vk}} divisible by 3)2 KB (367 words) - 12:42, 9 May 2024
- ...iskovets-Gallot conjectures]], which relate to the smallest [[Riesel prime|Riesel]] and [[Proth prime|Proth]] {{Vk}}-values, divisible by 3, with no primes f ...s was proven by [[Yves Gallot]], who provided examples for all four cases (Riesel/Proth, even/odd). Gallot further conjectured that these four examples are t7 KB (957 words) - 22:40, 10 June 2023
- {{Riesel prime |RRemarks=This k-value seems the smallest k ≡ 0 mod 3 for which {{Kbn|k|n}} is never prime for an even ''n''. See [[Liskovets-Gallot conjectures]].443 bytes (43 words) - 08:19, 1 August 2021
- {{Riesel prime ...ks=This {{Vk}}-value seems the smallest {{Vk}} ≡ 0 mod 3 for which {{Kbn|k|n}} is never prime for an odd {{Vn}}. See [[Liskovets-Gallot conjectures]].383 bytes (44 words) - 12:53, 29 July 2021
- ...ris Nash]] gave a weight to show the number of remaining values of {{Kbn|+|k|n}} after sieving the range 100000 < {{Vn}} < 110000 after performing a Nas A later definition was also done for {{Kbn|k|n}}.2 KB (330 words) - 09:11, 23 September 2021
- {{DISPLAYTITLE:Riesel numbers of the form {{Kbn|k|n}} with {{Vk}} mod 3 = 0}} Riesel numbers {{Kbn|k|n}} where {{Vk}}-value is a multiple of 3.1 KB (153 words) - 06:55, 16 July 2021
- ...n}}]] || {{Vk}}-value || style="text-align:right;"|{{Num|{{PAGESINCATEGORY:Riesel 2|pages|R}}}} ...>2 || base || style="text-align:right;"|{{Num|{{#expr:{{PAGESINCATEGORY:Riesel prime|subcats|R}}-3}}}}11 KB (1,385 words) - 17:23, 5 April 2024
- {{DISPLAYTITLE:Riesel primes of the form {{Kbn|k|10|n}}}} ...www.noprimeleftbehind.net/gary/primes-kx10n-1.htm Primes of the form {{Kbn|k|10|n}}] compiled by [[Gary Barnes]]681 bytes (93 words) - 13:01, 2 August 2021
- __NOTOC__{{DISPLAYTITLE:Riesel primes of the form {{Kbn|k|n}}, {{Num|25000}} ≤ {{Vk}} ≤ {{Num|100000}}}} *For {{Num|10000}} ≤ {{Vk}} ≤ {{Num|25000}} see [[Riesel 2 10e4-10e5|here]]1 KB (165 words) - 09:15, 22 July 2021
- *Name: [[Riesel Prime Search]] Drive 12 *Purpose: The goal of this drive is to search for primes of the form {{Kbn|k|2|n}} for 13 high-weighted 2000 < {{Vk}} < 2300.537 bytes (60 words) - 10:53, 11 January 2023
- {{DISPLAYTITLE:Riesel primes of the form {{Kbn|k|n}} with missing ranges}} This page lists '''Riesel {{Vk}}-values on this Wiki with missing ranges''' below the largest known p1 KB (192 words) - 09:07, 23 September 2021
- *Create own template to calculate indexes for long numbers, see [[Riesel k=3k value]] *expand more prime templates like Riesel prime template790 bytes (110 words) - 09:54, 9 October 2020
- {{DISPLAYTITLE:Riesel problem 2, {{Kbn|-|k|2|n}}, {{Num|509203}} < {{Vk}} < {{Num|762701}}}} ...]]s {{Kbn|k|2|n}} for 509203 < {{Vk}} < 762701, the first and second Riesel {{Vk}}-values without any possible primes.4 KB (386 words) - 06:41, 29 March 2024
- Finding primes for the [[Riesel problem 2]]. ==k-values left==1 KB (140 words) - 07:49, 27 March 2024
- *Name: [[Riesel Prime Search]] Drive 11 *Purpose: The goal of this drive is to search for primes of the form {{Kbn|k|2|n}} for 123 values with 2000 < {{Vk}} < 2300.565 bytes (77 words) - 10:57, 11 January 2023
- {{DISPLAYTITLE:Riesel problem 3, {{Kbn|-|k|2|n}}, {{Num|762701}} < {{Vk}} < {{Num|777149}}}} ...} for {{Num|762701}} < {{Vk}} < {{Num|777149}}, the second and third Riesel {{Vk}}-values without any possible primes.4 KB (337 words) - 18:52, 30 April 2024
- {{DISPLAYTITLE:The Even Riesel Problem}} ...m]] is to find the smallest [[Riesel number]] {{Vk}} (odd) such that {{Kbn|k|2|n}} is composite for every {{Vn}} ≥ 1.<br>7 KB (718 words) - 10:32, 26 March 2024
- ...h_480000.csv|format=csv with header|delimiter=,|data=date=date,user=user,k=k,n=n}} {{!}} style="text-align:right" {{!}} [[Riesel prime 2 {{{k}}}|{{Kbn|{{{k}}}|{{{n}}}}}]]2 KB (262 words) - 10:53, 21 March 2024
- ..._1700000.csv|format=csv with header|delimiter=,|data=date=date,user=user,k=k,post=post}} {{!}} style="text-align:right" {{!}} [[Riesel prime 2 {{{k}}}|{{Kbn|{{{k}}}|1700000}}]]2 KB (208 words) - 18:36, 30 April 2024
- ..._3322000.csv|format=csv with header|delimiter=,|data=date=date,user=user,k=k,post=post}} {{!}} style="text-align:right" {{!}} [[Riesel prime 2 {{{k}}}|{{Kbn|{{{k}}}|3322000}}]]2 KB (204 words) - 18:39, 30 April 2024
- {{DISPLAYTITLE:Riesel problem 4, {{Kbn|-|k|2|n}}, {{Num|777149}} < {{Vk}} < {{Num|790841}}}} ...} for {{Num|777149}} < {{Vk}} < {{Num|790841}}, the third and fourth Riesel {{Vk}}-values without any possible primes.4 KB (336 words) - 18:50, 30 April 2024
- ===Create a new page for a Riesel-type entry {{Kbn|k|b|n}}=== ...ructions. For information how to fill in the parameters see '''[[:Template:Riesel prime|here]]'''.2 KB (321 words) - 11:03, 23 April 2024
- ...h_333444.csv|format=csv with header|delimiter=,|data=date=date,user=user,k=k,post=post}} {{!}} style="text-align:right" {{!}} [[Riesel prime 2 {{{k}}}|{{Kbn|{{{k}}}|1700000}}]]2 KB (202 words) - 10:52, 21 March 2024
- ...009979551311559|{{Kbn|23009979551311559|2|n}}]] is set for the [[:Template:K-type|types/categories]] of ''3'' and ''15'', which is wrong.562 bytes (88 words) - 09:08, 4 March 2024
- ...h_222333.csv|format=csv with header|delimiter=,|data=date=date,user=user,k=k}} {{!}} style="text-align:right" {{!}} [[Riesel prime 2 {{{k}}}|{{Kbn|{{{k}}}|222333}}]]2 KB (204 words) - 10:51, 21 March 2024
- {{DISPLAYTITLE:Real Riesel problem 1, {{Kbn|-|k|2|n}}, {{Vk}} < {{Num|509203}}, {{Vb}}<sup>{{Vn}}</sup> > {{Vk}}}} *not included {{Vk}}-values of the original [[Riesel problem 1|Riesel problem]]938 bytes (122 words) - 12:25, 14 April 2024
- *Type: Riesel,Proth,SG,Twin,GFN,... *k-values: if ongoing, currently used values3 KB (372 words) - 16:57, 11 May 2024