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

  • 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>.
    517 bytes (83 words) - 01:16, 11 August 2024
  • 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
  • What use are prime numbers anyway?
    ...orem of Arithmetic", states that every positive integer (except the number 1) can be expressed in exactly one way as the product of one or more primes.
    3 KB (497 words) - 07:17, 22 May 2020
  • Overclocking and Prime95
    ...If you proved that the maximum accumulated error cannot be more than +/-0.1 on a correct calculation then a processing error must have occurred. ...ng around the TLC site. Get things working stable and then drop the FSB by 1 MHz to give you a better safety factor.
    12 KB (1,995 words) - 09:55, 7 March 2019
  • Overclocking
    ...de Bus' (hereafter referred to as the FSB) speed. Lets say you have a nice 1.6A P4. (Historically this was one of the best CPUs for overclocking). That ...omething called a multiplier. It just so happens that the multiplier for a 1.6GHz P4 is 16. The reason behind this is quite simple...
    14 KB (2,326 words) - 15:17, 11 February 2019
  • Triangular number
    :4△ = 4 + 3 + 2 + 1 = 10 (10 pin bowling uses a triangular arrangement.) :5△ = 5 + 4 + 3 + 2 + 1 = 15 (a common billiards arrangement is 15 balls in a triangle.)
    658 bytes (81 words) - 00:59, 11 August 2024
  • Pocklington's theorem
    ...= 1</math>, then each prime factor ''q'' of ''N'' has the form <math>q^kr+1</math>. ...it can be deduced a primality test when only a partial factorization of N-1 is known:
    2 KB (347 words) - 01:15, 11 August 2024
  • Multiple polynomial quadratic sieve
    :<math>45^2\,\equiv \,2^4*7^0*13^1</math> :<math>123^2\,\equiv \,2^{10}*7^0*13^1</math>
    6 KB (1,068 words) - 14:33, 13 February 2019
  • Proth number
    ...condition that 2<sup>{{Vn}}</sup> > {{Vk}}, all odd integers greater than 1 would be Proth numbers, but most pages lists them, too.
    670 bytes (104 words) - 10:59, 9 July 2021
  • 27121 Search
    ...f the form: 27 &times; 2<sup>n</sup> ± 1 and 121 &times; 2<sup>n</sup> ± 1. ...es are 27 &times; 2<sup>1902689</sup>-1 and 27 &times; 2<sup>2218064</sup>+1, which weighs in at 572768 digits and 667706 digits, found on 2009-12-10 a
    983 bytes (138 words) - 13:25, 8 February 2019
  • 12121 Search
    ...2<sup>n</sup>-1, it also searches for primes of 121 &times; 2<sup>n</sup>+1 after being a partner of [[PrimeGrid]]. ...The Prime Pages]], their largest number is 121 &times; 2<sup>2033941</sup>-1 which weighs in at 612280 digits. This prime was found on 2006-01-28.
    984 bytes (143 words) - 13:30, 8 February 2019

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

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