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 "1" on this wiki! See also the search results found.

Page title matches

Page text matches

  • Why participate in GIMPS?
    ...are known) are all closely related to the primes of the form 2<sup>p</sup>-1, for some prime ''p'' (now called [[Mersenne prime|Mersennes]]). So the que ...w. Mersennes have one of the simplest possible forms for primes, <math>2^p-1</math>. The proof of their primality has an elegant simplicity (to a mathem
    7 KB (1,252 words) - 09:47, 7 March 2019
  • Sieving
    ...etween 2 and the square root of the maximum member of the sequence, set to 1 those elements of the array that correspond to the multiples of the current ...composites. But this can be fixed easily by do not setting that element to 1 if the member of the sequence is equal to the prime used in the loop.
    3 KB (521 words) - 11:14, 6 February 2019
  • Sieving program
    ...ing sieving of generalized Cullen/Woodall numbers n &times; b<sup>n</sup>+-1) http://sites.google.com/site/geoffreywalterreynolds/programs/gcwsieve ...ieving for factors of numbers of the form K &times; 2<sup>n</sup> + 1 or - 1. Independent of K's, but good for many N's too) and [[TPSieve]] (similar to
    2 KB (220 words) - 11:42, 7 March 2019
  • NewPGen
    *k&times;b<sup>n</sup>+1 *k&times;b<sup>n</sup>-1
    3 KB (529 words) - 09:32, 7 March 2019
  • Sophie Germain prime
    .... For example, 23 is a Sophie Germain prime because it is a prime and 2*23+1 = 47, also prime. | 1 || 2 || -
    1 KB (171 words) - 04:26, 3 November 2020
  • M13
    '''M13''' is the 13th known [[Mersenne prime]] 2<sup>521</sup>-1 found on 1952-01-30 by [[Raphael M. Robinson]].
    419 bytes (48 words) - 14:50, 19 September 2021
  • M14
    '''M14''' is the 14th known [[Mersenne prime]] 2<sup>607</sup>-1 found on 1952-01-30 by [[Raphael M. Robinson]].
    420 bytes (48 words) - 14:49, 19 September 2021
  • M15
    '''M15''' is the 15th known [[Mersenne prime]] 2<sup>{{Num|1279}}</sup>-1 found on 1952-06-25 by [[Raphael M. Robinson]].
    430 bytes (49 words) - 14:49, 19 September 2021
  • M16
    '''M16''' is the 16th known [[Mersenne prime]] 2<sup>{{Num|2203}}</sup>-1 found on 1952-10-07 by [[Raphael M. Robinson]].
    431 bytes (49 words) - 14:49, 19 September 2021
  • M17
    '''M17''' is the 17th known [[Mersenne prime]] 2<sup>{{Num|2281}}</sup>-1 found on 1952-11-09 by [[Raphael M. Robinson]].
    431 bytes (49 words) - 14:49, 19 September 2021
  • M18
    '''M18''' is the 18th known [[Mersenne prime]] 2<sup>{{Num|3217}}</sup>-1 found on 1957-09-08 by [[Hans Riesel]].
    415 bytes (47 words) - 22:26, 17 February 2019
  • M11
    '''M11''' is the 11th known [[Mersenne prime]] 2<sup>107</sup>-1</math> found in 1914 by [[Ralph Ernest Powers]].
    412 bytes (47 words) - 14:23, 17 February 2019
  • M10
    '''M10''' is the 10th known [[Mersenne prime]] <math>2^{89}-1</math> found in 1911 by [[Ralph Ernest Powers]].
    403 bytes (44 words) - 13:54, 17 February 2019
  • Proth's theorem
    Let <math>p = k*2^n+1</math> and <math>k < 2^n</math>; then <math>p</math> is prime if there is a :<math>a^{(p-1)/2} \equiv -1\pmod{p}</math>.
    549 bytes (88 words) - 18:15, 28 September 2023
  • Proth prime
    Different from this definition all values ''n'' ≥ 1 are listed in {{SITENAME}}.
    656 bytes (91 words) - 07:02, 31 August 2020
  • Riesel prime
    Different from this definition all values {{Vn}} ≥ 1 are listed in {{SITENAME}}. ...servations/status"]: [https://www.mersenneforum.org/showpost.php?p=109831 #1 (2007-07-08)] - [https://www.mersenneforum.org/showpost.php?p=655641 #1081
    2 KB (280 words) - 00:37, 25 May 2024
  • Riesel Sieve
    Riesel Sieve is a distributed effort to prove the [[Riesel problem 1|Riesel problem]] (which states that {{Vk}}=509203 is the smallest possible
    2 KB (326 words) - 10:29, 26 March 2024
  • M26
    '''M26''' is the 26th known [[Mersenne prime]] 2<sup>{{Num|23209}}</sup>-1 found on 1979-02-09 by [[Landon Curt Noll]].
    455 bytes (52 words) - 23:01, 17 February 2019
  • Power of two
    ...1 kibibyte. 1024<sup>2</sup> bytes = 1 mebibyte, 1024<sup>3</sup> bytes = 1 gibibyte, and so on.
    839 bytes (127 words) - 11:38, 6 February 2019
  • Introductory stuff
    :Test=13974239,65,1 ...= 2<sup>2</sup> - 1 is a Mersenne prime; so is 7 = 8 - 1 = 2<sup>3</sup> - 1. See [[Mersenne prime]].
    14 KB (2,370 words) - 15:15, 17 August 2019

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

Retrieved from "https://www.rieselprime.de/ziki/Special:Search"