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.
- ==Example table for Sierpinski/Riesel problems== **conjectured k (CK) and the covering set in {}3 KB (328 words) - 07:35, 3 July 2020
- ...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 (507 words) - 08:29, 29 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 (774 words) - 07:39, 27 May 2024
- ...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. ...rsenneforum.org/showthread.php?t=29635 "Team drive #1 for {{Vk}}<300: many k's for {{Vn}}=2M-3M"]: [https://www.mersenneforum.org/showpost.php?p=6556082 KB (280 words) - 00:37, 25 May 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
- *[[Proth number|Proth]] {{Kbn|+|k|2|n}} *[[Riesel number|Riesel]] {{Kbn|k|2|n}}1 KB (170 words) - 16:41, 5 April 2024
- ...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