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

Jump to: navigation, search

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) - 02:20, 1 May 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<sup>{{Vn}}</sup> > {{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.
    845 bytes (120 words) - 02:21, 1 May 2024
  • Riesel prime
    ...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 #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 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 (201 words) - 13:33, 5 May 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
  • RPS Megabit Drive 1
    The goal of this drive is to search for primes of the form {{Kbn|k|n}} for {{Vk}} &le; 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
  • PrimeGrid Sierpiński base 5
    ==k-values left== *[[PrimeGrid Riesel base 5]]
    2 KB (245 words) - 11:43, 5 September 2021
  • Riesel 2 Count-100
    {{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
  • Riesel 2 15k-value
    {{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
  • Riesel 2 2145k-value
    {{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
  • Riesel 2 2805k-value
    {{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
  • Riesel 2 Count-0
    {{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
  • Liskovets-Gallot conjectures
    ...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
  • Nash weight
    ...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
  • Riesel 2 3k-value
    {{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
  • Statistics
    ...n}}]] || {{Vk}}-value || style="text-align:right;"|{{Num|{{PAGESINCATEGORY:Riesel 2|pages|R}}}} ...&gt;2 || base || style="text-align:right;"|{{Num|{{#expr:{{PAGESINCATEGORY:Riesel prime|subcats|R}}-3}}}}
    11 KB (1,385 words) - 17:23, 5 April 2024
  • Riesel 2 Missing-range
    {{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 p
    1 KB (192 words) - 09:07, 23 September 2021
  • Riesel problem 2
    {{DISPLAYTITLE:Riesel problem 2, {{Kbn|-|k|2|n}}, {{Num|509203}} < {{Vk}} < {{Num|762701}}}} ...]]s {{Kbn|k|2|n}} for 509203 &lt; {{Vk}} &lt; 762701, the first and second Riesel {{Vk}}-values without any possible primes.
    4 KB (386 words) - 06:41, 29 March 2024
  • 2nd Riesel Problem
    Finding primes for the [[Riesel problem 2]]. ==k-values left==
    1 KB (140 words) - 07:49, 27 March 2024
  • Riesel problem 3
    {{DISPLAYTITLE:Riesel problem 3, {{Kbn|-|k|2|n}}, {{Num|762701}} < {{Vk}} < {{Num|777149}}}} ...} for {{Num|762701}} &lt; {{Vk}} &lt; {{Num|777149}}, the second and third Riesel {{Vk}}-values without any possible primes.
    4 KB (337 words) - 18:52, 30 April 2024
  • Even Riesel Problem
    {{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}} &ge; 1.<br>
    7 KB (718 words) - 10:32, 26 March 2024
  • Twin Prime Search 3322000
    ..._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
  • Riesel problem 4
    {{DISPLAYTITLE:Riesel problem 4, {{Kbn|-|k|2|n}}, {{Num|777149}} < {{Vk}} < {{Num|790841}}}} ...} for {{Num|777149}} &lt; {{Vk}} &lt; {{Num|790841}}, the third and fourth Riesel {{Vk}}-values without any possible primes.
    4 KB (336 words) - 18:50, 30 April 2024
  • Riesel problem real 1
    {{DISPLAYTITLE:Real Riesel problem 1, {{Kbn|-|k|2|n}}, {{Vk}} < {{Num|509203}}, {{Vb}}<sup>{{Vn}}</sup> &gt; {{Vk}}}} *not included {{Vk}}-values of the original [[Riesel problem 1|Riesel problem]]
    938 bytes (122 words) - 12:25, 14 April 2024
Retrieved from "https://www.rieselprime.de/ziki/Special:Search"