Search results

Create the page "Riesel k=1-300" on this wiki! See also the search results found.

• Mersenne prime
  ...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
• Conjectures 'R Us
  ...]] 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}} &ge; 1. Conje
  3 KB (503 words) - 04:44, 27 March 2024
• Sierpiński problem
  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
• Riesel number
  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
• Primality test
  *[[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^{{Vn}} > {{Vk}}, making it useful in several [[distrib
  3 KB (501 words) - 05:20, 3 August 2021
• LLR
  '''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
• Generalized Fermat number
  ...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
• PrimeGrid
  ...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
• Riesel Prime Search
  '''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.
  852 bytes (120 words) - 20:24, 7 March 2024
• Riesel prime
  ...ial definition of a '''Riesel prime''' mostly all primes of the form {{Kbn|k|n}} with 2^{{Vn}} > {{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 #1
  2 KB (279 words) - 03:48, 24 April 2024
• Riesel Sieve
  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
• Proth number
  :{{V|N}} = {{Kbn|+|k|2|n}} *[[Riesel number]]
  670 bytes (104 words) - 10:59, 9 July 2021
• Gerbicz error checking
  ...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 theor
  3 KB (528 words) - 14:59, 3 October 2023
• Riesel number base 5
  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
• Riesel problem 1
  {{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 LLR
  '''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 perman
  2 KB (337 words) - 13:24, 20 February 2019
• Riesel prime 2 17
  {{Riesel prime |RReserved=RPS k=17
  2 KB (159 words) - 06:44, 16 April 2024
• Riesel prime small bases least n
  {{DISPLAYTITLE:Riesel primes of the form {{Kbn|k|b|n}}, least {{Vn}}-values}} ...wn the least {{Vn}} &ge; 1 generating a [[Riesel prime]] of the form {{Kbn|k|b|n}} for 2 &le; {{Vb}} &le; 1030 and 2 &le; {{Vk}} &le; 12.
  6 KB (684 words) - 09:40, 17 March 2024
• Riesel prime 2 61
  {{Riesel prime {{HistF|2017-01-30|3366033|Rüdiger K. Eckhard}}
  2 KB (211 words) - 06:53, 21 April 2024
• Riesel 2 1-300
  {{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

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)