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

Page title matches

Page text matches

  • User:Karbon
    ...Top5000 Prover code]: My primes found, latest {{PP|126269|(290^124116-1)^2-2}} echo number_format($number, 2, ',', '.');
    3 KB (328 words) - 07:35, 3 July 2020
  • Template:Languages/Lang
    {{#ifexist: {{#if:{{{2|}}}|{{{2}}}|{{translatable}}}}/{{{1|}}} |&nbsp;• <bdi lang="{{{1|}}}">{{#if:{{{2|}}}
    278 bytes (15 words) - 08:06, 6 December 2018
  • Template:Dir
    ...fa-af|glk|ha|he|kk-arab|kk-cn|ks|ku-arab|mzn|pnb|prd|ps|sd|ug|ur|ydd|yi={{{2|rtl}}}|{{{3|ltr}}}}}<noinclude>[[Category:Multilanguage]]</noinclude>
    217 bytes (36 words) - 22:35, 15 December 2018
  • Williams prime
    ...a [[natural number]] of the form {{Kbn|(b-1)|b|n}} for integers ''b'' ≥ 2 and ''n'' ≥ 1. ...Smallest <ref>The list of smallest primes of any base is an ASCII file for 2 ≤ ''b'' ≤ 1024. For unknown values only the base is given.</ref> !! Rem
    5 KB (744 words) - 07:30, 5 August 2019
  • MediaWiki:Gadget-Vorlagenmeister/core.js
    * Released under the GPL license version 2 * it under the terms of the GNU General Public License version 2 as
    129 KB (11,879 words) - 13:07, 13 December 2018
  • MediaWiki:Gadget-charinsert-core.js
    addLink( token.substring( 1 ), '</' + token.substring( 2 ), token.substring( 1 ) ); } else if ( token.length > 2 && token.charCodeAt( 0 ) > 127 ) { // a string of insertable characters
    15 KB (1,015 words) - 07:32, 19 July 2021
  • Template:Carol-Kynea prime
    |CKBase=2 2;564
    4 KB (501 words) - 01:58, 17 May 2021
  • Carol-Kynea prime 2
    |CKBase=2 2
    5 KB (537 words) - 08:17, 9 October 2020
  • Carol-Kynea prime 6
    2 2
    1 KB (85 words) - 10:45, 16 April 2023
  • Template:GP
    Get the parameter "CKBase" from "Carol-Kynea base 2" primes *<nowiki>{{GP|Carol-Kynea prime 2|CKBase}}</nowiki> results in
    3 KB (311 words) - 18:08, 13 August 2021
  • Template:NVal
    -->{{#if:{{#pos:{{#var:part}}|C:}}|{{#vardefine:c2|{{#sub:{{#var:part}}|2}}}}}}<!-- |2
    3 KB (440 words) - 16:51, 22 March 2024
  • Template:T5000
    {{T5000|125874|2<sup>82589933</sup>-1}} :{{T5000|125874|2<sup>82589933</sup>-1}}
    522 bytes (68 words) - 21:41, 7 May 2024
  • Srsieve
    '''srsieve''' (and '''sr1/2/5sieve''') is used to create sieve files for one or more sequences. Those s
    2 KB (265 words) - 07:36, 28 May 2021
  • Template:PieChart
    "version": 2,
    1 KB (100 words) - 20:11, 2 January 2019
  • Help:Examples
    <pre><math>\sideset{_1^2}{_3^4}\prod_a^b</math></pre> :<math>\sideset{_1^2}{_3^4}\prod_a^b</math>
    11 KB (1,236 words) - 08:27, 15 May 2024
  • Template:Greatest Mersenne Prime
    |number=<math>2^{82\,589\,933}-1</math> ([[M51]]) |only=2<sup>{{Num|82589933}}</sup>-1
    2 KB (264 words) - 16:55, 7 April 2019
  • Great Internet Mersenne Prime Search
    ...as born in 1588. Mersenne investigated a particular type of prime numbers: 2<sup>p</sup> - 1, in which ''p'' is an ordinary [[prime]].
    3 KB (450 words) - 14:37, 21 August 2019
  • List of known Mersenne primes
    *'''Digits in M<sub>n</sub>''': denotes the [[Mersenne prime]] 2<sup>n</sup>-1 and a downloadable decimal representation ...n P<sub>n</sub>''': denotes the [[Perfect number]] 2<sup>n-1</sup> &bull; (2<sup>n</sup>-1) and a downloadable decimal representation
    2 KB (360 words) - 09:44, 6 March 2019
  • Mersenne prime
    ...is one less than a [[power of two]]. For example, 3 = 4 &minus; 1 = {{Kbn|2}} is a Mersenne prime; so is 7 = 8 &minus; 1 = {{Kbn|3}}. On the other hand :<math>M_n=2^n{-}1</math> .
    5 KB (857 words) - 14:53, 19 September 2021
  • Mersenne number
    A '''Mersenne number''' is a number of the form <math>2^n{-}1</math> where <math>n</math> is a non-negative [[integer]]. ...senne number <math>2^n{-}1</math> can be calculated by <math>\lfloor{n*log(2)}\rfloor+1</math> (see [[floor function]]).
    2 KB (351 words) - 11:28, 7 March 2019
  • Leonhard Euler
    ...for finite differences <math>\large\delta y</math> and <math>\large\delta^2 y</math> and many more.
    16 KB (2,614 words) - 11:48, 14 January 2024
  • Marin Mersenne
    : <math>\sqrt[4]{\frac{2}{3-\sqrt{2}}}</math> ...ined if the ratio of the air oscillation frequencies is also 1&nbsp;:&nbsp;2, which in turn is consistent with the source-air-motion-frequency-equivalen
    11 KB (1,582 words) - 01:17, 15 January 2024
  • Euclid
    ...c and fundamental parts of geometry; 1. A point is that which has no part. 2. A line is breadthless length. From these definitions of the point and the
    2 KB (341 words) - 11:43, 14 January 2024
  • Landon Curt Noll
    ...l candidates with prime [[exponent]]s up to and including M26. During that 2 hour period, it duplicated what had previously occurred over a 520 year per
    2 KB (333 words) - 12:40, 9 February 2022
  • Laura A. Nickel
    ...aura A. Nickel''') with [[Landon Curt Noll]] discovered on 1978-10-30 that 2<sup>21701</sup>-1 was the [[M25|25th Mersenne prime]]. This made internatio
    2 KB (254 words) - 01:23, 15 January 2024
  • David Slowinski
    | [[M27]] || 2<sup>{{Num|44497}}</sup>-1 || 1979-04-08 | [[M28]] || 2<sup>{{Num|86243}}</sup>-1 || 1982-09-25
    1 KB (213 words) - 23:53, 14 January 2024
  • Fermat number
    :{{V|F}}<sub>{{Vn}}</sub> = {{Kbn|+|1|2|2<sup>n</sup>}} :{{V|F}}<sub>1</sub> = {{Kbn|+|2}} = 5
    12 KB (1,913 words) - 14:35, 9 August 2021
  • M50
    The official discovery date for prime 2<sup>77 232 917</sup>-1 was 2017-12-26. See the [https://www.mersenne.org/pr ...glund also confirmed using Mlucas running on an [[Amazon EC2]] instance in 2.7 days
    2 KB (333 words) - 13:16, 17 February 2019
  • M49
    The official discovery date for 2<sup>{{Num|74207281}}</sup>-1 was 2016-01-07. See the [http://www.mersenne.o ...ill, who each ran the [[CUDALucas]] software on NVidia Titan Black GPUs in 2.3 days
    2 KB (283 words) - 11:50, 18 February 2019
  • Curtis Cooper
    ...-09-04 when the pair discovered the [[M44|44th]] known [[Mersenne prime]], 2<sup>32 582 657</sup>-1. As of 2008-09-15 his account is ranked #1 on [[Prim On 2013-01-25 Cooper discovered his third Mersenne prime, 2<sup>57 885 161</sup>-1, the [[M48|48th]] known.
    2 KB (237 words) - 11:34, 14 January 2024
  • Derrick Henry Lehmer
    ...k's father enabled them to find factors for all integers up to ''48911<sup>2</sup>'', and these factorisations were published in a book in 1929. That su ...improvement to the [[Lucas primality test]] for [[Mersenne prime]]s <math>2^p{-}1</math>, extending its application to all odd prime exponents ''p'', a
    6 KB (1,033 words) - 01:13, 15 January 2024
  • Category:Home Prime Search
    ...or in any [[base]]. The following links go to pages with results for bases 2 through 10.
    3 members (0 subcategories, 0 files) - 23:59, 5 March 2019
  • Home prime
    ==Base 2== HP<sub>2</sub>(10):
    980 bytes (143 words) - 13:22, 6 March 2019
  • Template:HP
    * <base>: the base of the Home Prime (only 2 to 11) {{HP|2|2295|281|189|2017-05-05|test user}}
    1 KB (140 words) - 13:49, 16 January 2019
  • Base 2 Home Prime Results
    ==Search for Home Primes base 2== {{HP|2|2295|281|189|2013-07-23|}}
    2 KB (175 words) - 18:45, 14 December 2023
  • PW:Babel
    |2||You're able to write simple texts and following fundamental discussions.
    1 KB (235 words) - 10:44, 21 March 2024
  • PW:Babel/de
    |2||Du kannst einfache Texte schreiben oder an grundlegenden Diskussionen teil
    2 KB (269 words) - 00:11, 17 January 2019
  • Cunningham tables
    *[[2 Minus Tables]] *[[2 Plus Tables]]
    614 bytes (69 words) - 12:08, 13 February 2019
  • Cunningham project
    ...zation]] of numbers of the form <math>b^n\pm 1</math> for <math>b</math> = 2, 3, 5, 6, 7, 10, 11, 12. The values of the exponent <math>n</math> are sele | 2 || 3 || 5 || 6 || 7 || 10 || 11 || 12
    7 KB (1,150 words) - 23:48, 19 April 2023
  • Template:FDBCunningham
    {{FDBCunningham|2|-|1|100}} will create the links for the Cunningham table for ''N'' = ''2''<sup>''n''</sup>-1 for ''n'' = 1 ... 100 and looks like this:
    1 KB (189 words) - 12:00, 13 February 2019
  • 2 Minus Tables
    ==Factorizations Of Cunningham Numbers C<sup>-</sup>(2,n) = 2<sup>n</sup> - 1== * 001 - 100 : {{FDBCunningham|2|-|1|100}}
    2 KB (176 words) - 12:01, 13 February 2019
  • M25
    M25 is 2<sup>{{Num|21701}}</sup>-1, a number of {{Num|6533}} [[digit]]s. .... They were testing this theory and that Tuckerman's discovery of [[M24]] (2<sup>{{Num|19937}}</sup>-1) was the start of this island.
    2 KB (303 words) - 11:01, 26 February 2019
  • Lucas-Lehmer test
    ...S<sub>0</sub>=4 and S<sub>n</sub> = (S<sub>n-1</sub>)<sup>2</sup> &minus; 2. In 1930, the American mathematician [[Derrick Henry Lehmer]] (1905 - 1991) ...hat 2<sup>5</sup> - 1 divides S<sub>3</sub> (37634 / 31 = 1214) shows that 2<sup>5</sup> - 1 is prime.
    20 KB (3,572 words) - 14:30, 17 February 2019
  • Édouard Lucas
    ...te the [[Lucas-Lehmer test]]. In 1876, Lucas proved the primality of <math>2^{127}{-}1</math> ([[M12]]) and this remained the highest [[Mersenne prime]]
    2 KB (296 words) - 01:09, 15 January 2024
  • Decimal
    ...at people use in most of the world. [[Computer]]s use '''binary''' or base 2. The length of a number (how many [[digit]]s it takes to write the number) ...us symbols (called [[digit]]s) for no more than ten distinct values (0, 1, 2, 3, 4, 5, 6, 7, 8 and 9) to represent any numbers, no matter how large. The
    1 KB (190 words) - 10:23, 18 January 2019
  • Base
    Different bases are often used in [[computer|computers]]. Binary (base 2) is used because at the most simple level, computers can only deal with 0s ! Decimal<br>base=10 !! Binary<br>base=2 !! Hexadecimal<br>base=16
    2 KB (399 words) - 10:37, 18 January 2019
  • Whole number
    *the nonnegative [[integer]]s (0, 1, 2, 3, ...) *the positive integers (1, 2, 3, ...) (often called [[natural number]]s)
    413 bytes (54 words) - 09:51, 8 February 2019
  • Integer
    ...[natural number]]s (1, 2, 3, &hellip;), their negatives (&minus;1, &minus;2, &minus;3, ...) and the number zero. The set of all integers is usually den ...f [[division]], since the quotient of two integers (''e.g.'', 1 divided by 2), need not be an integer.
    3 KB (404 words) - 14:58, 26 March 2023
  • Mathematics
    ...s <math>a</math> and <math>b</math>, <math>(a + b) * (a - b)\,=\,a^2\,-\,b^2</math>.
    1 KB (186 words) - 17:00, 5 February 2019
  • Addition
    In [[mathematics]]: to sum 2 numbers. It is normally symbolized by the plus sign '+'. :2 + 2 = 4
    333 bytes (43 words) - 16:55, 29 August 2022
  • Multiplication
    ...largest available register is ''n'' bits wide the factors can only be ''n/2'' bits wide each.
    2 KB (271 words) - 17:00, 29 August 2022
  • Factorial number
    :<math>n! = 1 \cdot 2 \cdot 3 \cdots (n{-}2) \cdot (n{-}1) \cdot n</math> :5! = 5 * 4 * 3 * 2 * 1 = 120
    729 bytes (93 words) - 13:40, 5 November 2023
  • Division
    :<math>\frac 63 = 2</math> :<math>2 \times 3 = 6</math>.
    2 KB (368 words) - 16:58, 29 August 2022
  • Remainder
    ...ft over after dividing something. Dividing 13 into groups of 5 would yield 2 groups, with a remainder of 3.
    245 bytes (34 words) - 14:07, 18 January 2019
  • Factoring Database
    **Greatest prime factor ^2+1, ^2+2, ^2-1, ^2-2, ^3+1, ^3-1
    1 KB (144 words) - 13:44, 24 January 2019
  • Factorization
    ...composite numbers have small factors (half of the numbers are multiples of 2, a third are multiples of 3 and so on) it pays to run factorization methods
    4 KB (642 words) - 12:57, 5 March 2019
  • M48
    The official discovery date for 2<sup>{{Num|57885161}}</sup>-1 was 2013-01-25. See the [http://www.mersenne.o *[https://www.youtube.com/watch?v=QSEKzFGpCQs New Largest Known Prime Number 2<sup>57,885,161</sup>-1] at YouTube channel Numberphile
    2 KB (235 words) - 11:49, 18 February 2019
  • Template:InfoboxProgram
    ...Program|title=CUDALucas|workload=[[Lucas-Lehmer test]]|release=2009|latest=2.06beta<br>2017-05-05}}</pre> ...Program|title=CUDALucas|workload=[[Lucas-Lehmer test]]|release=2009|latest=2.06beta<br>2017-05-05}}
    1,015 bytes (124 words) - 11:51, 7 March 2019
  • M47
    ...found. [[M45]], [[M46]], and M47 were discovered in the order of M47, M45 (2 weeks later), then M46 (8 months later). On 2018-04-08 all tests below 2<sup>{{Num|43112609}}</sup>-1 were verified by [[GIMPS]], officially making
    5 KB (694 words) - 13:17, 21 August 2019
  • Prime95
    ...fafaf; background-color: #f9f9f9; border-collapse: collapse;" cellpadding="2" !Comparison of CPU core power!!Frequency!!Cores!!colspan="2" | [[Fast Fourier transform|FFT]]!![[Trial factoring]]!!TDP
    11 KB (1,586 words) - 12:24, 7 August 2021
  • Even number
    ...n the physcial world, an even number of objects can be placed into exactly 2 groups that have the identical number of objects. All numbers ending in 0, 2, 4, 6, or 8 are even.
    425 bytes (61 words) - 11:19, 7 March 2019
  • Odd number
    An '''odd number''' is any [[integer]] that is not divisible by 2. ...notation, the odd numbers end in 1, 3, 5, 7 or 9. All prime numbers except 2 are odd.
    316 bytes (42 words) - 11:21, 7 March 2019
  • M41
    | foundwith=[[Lucas-Lehmer test]] / [[Prime95]] on 2.4 GHz Pentium 4 [[Personal computer|PC]] '''M41''' is the short hand used to refer to the 41st [[Mersenne prime]] 2<sup>{{Num|24036583}}</sup>-1.
    1 KB (203 words) - 11:26, 18 February 2019
  • M43
    | foundwith=[[Lucas-Lehmer test]] / [[Prime95]] on 2 GHz Pentium 4 [[Personal computer|PC]] '''M43''' is the short hand used to refer to the 43rd [[Mersenne prime]] 2<sup>{{Num|30402457}}</sup>-1.
    1 KB (191 words) - 11:31, 18 February 2019
  • M46
    | foundwith=[[Lucas-Lehmer test]] / [[Prime95]] on 3 GHz Core 2 [[Personal computer|PC]] '''M46''' is the short hand used to refer to the 46th [[Mersenne prime]] 2<sup>{{Num|42643801}}</sup>-1.
    2 KB (248 words) - 11:45, 18 February 2019
  • Riesel prime 2 21143
    |Rb=2
    403 bytes (26 words) - 18:40, 2 January 2023
  • Riesel prime 2 102765
    |Rb=2
    935 bytes (70 words) - 18:56, 10 December 2022
  • Riesel prime 2 182627
    |Rb=2
    255 bytes (24 words) - 22:20, 10 December 2022
  • Proth prime 2 1089927
    |Pb=2
    440 bytes (36 words) - 07:56, 17 May 2024
  • Proth prime 2 12321
    |Pb=2
    498 bytes (31 words) - 13:34, 2 January 2023
  • Riesel prime 2 187605
    |Rb=2 2;T:S
    490 bytes (35 words) - 12:22, 11 December 2022
  • Riesel prime 2 132165
    |Rb=2 2
    557 bytes (25 words) - 12:35, 11 December 2022
  • Proth prime 2 1943873
    |Pb=2
    334 bytes (32 words) - 15:12, 27 January 2023
  • Program
    ...Programming, Volume 2, 3rd Edition, 1997, Addison-Wesley, ISBN 0-201-89684-2
    2 KB (263 words) - 11:53, 7 February 2019
  • M42
    | foundwith=[[Lucas-Lehmer test]] / [[Prime95]] on 2.4 GHz Pentium 4 [[Personal computer|PC]] '''M42''' refers to the 42nd [[Mersenne prime]] 2<sup>{{Num|25964951}}</sup>-1.
    934 bytes (118 words) - 11:26, 18 February 2019
  • M1
    | nvalue= 2
    193 bytes (19 words) - 13:43, 17 February 2019
  • Conjectures 'R Us
    ...t in proving the [[Liskovets-Gallot conjectures]] for the forms {{Kbn|±|k|2|n}} where {{Vn}} is always odd '''and''' where {{Vn}} is always even. ==Sub-project #2==
    3 KB (503 words) - 02:20, 1 May 2024
  • Fast Fourier transform
    :<math>\large f_j = \sum_{k=0}^{n-1} x_k e^{-{2\pi i \over n} jk } \qquad j = 0, ... ,n-1.</math> Evaluating these sums directly would take O(''n''<sup>2</sup>) arithmetical operations . An FFT is an algorithm to compute the same
    17 KB (2,684 words) - 18:50, 28 September 2023
  • GpuLucas
    ...rform nearly two times faster than [[CUDALucas]] due to using non-power-of-2 [[Fast Fourier transform|FFT]] lengths. [http://www.mersenneforum.org/showt
    2 KB (239 words) - 11:12, 13 February 2019
  • GpuOwL
    ...ehmer test|LL]], [[Probable prime|PRP]]|title=gpuOwL|release=2017|latest=7.2<br>2020-11-01}} ...nch] at GitHub (version 1 uses 4M FFT and is about 50% faster than version 2) [http://www.mersenneforum.org/showpost.php?p=479585&postcount=320]
    1 KB (216 words) - 05:22, 1 December 2020
  • M32
    | foundwith=[[Lucas-Lehmer test]] / Maple on Harwell Lab [[Cray-2]] :2<sup>756 839</sup>-1, a number {{Num|227832}} [[decimal]] [[digit]] long was
    2 KB (279 words) - 08:35, 18 February 2019
  • M33
    '''M33''' refers to 33rd [[Mersenne prime]] number 2<sup>{{Num|859433}}</sup>-1. ...percomputer]]. Computation of [[Lucas-Lehmer test]] for this number took 7.2 hours.
    814 bytes (97 words) - 08:38, 18 February 2019
  • M34
    ...size (smallest to largest) and in order of discovery. Specifically M34 is 2<sup>{{Num|1257787}}</sup>-1, which is a number {{Num|378632}} [[decimal]] [
    3 KB (513 words) - 08:42, 18 February 2019
  • No Prime Left Behind
    ...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 reserve
    745 bytes (111 words) - 02:17, 1 May 2024
  • 2 Plus Tables
    ==Factorizations Of Cunningham Numbers C<sup>+</sup>(2,n) = 2<sup>n</sup> + 1== * 001 - 100 : {{FDBCunningham|2|+|1|100}}
    2 KB (127 words) - 15:28, 17 August 2019
  • Absolute value
    <math>|z| = \sqrt{x^2+y^2}</math>
    556 bytes (89 words) - 16:58, 29 August 2022
  • Rational number
    ...power of 2 multiplied by a perfect power of 5, i.e. it has the form <math>2^n \times 5^m</math>.
    3 KB (541 words) - 15:01, 26 March 2023
  • Irrational number
    ...at to be a definition. Some examples of irrational numbers are <math>\sqrt{2}</math> or <math>e</math>.
    763 bytes (124 words) - 15:14, 26 March 2023
  • Binary
    ...umbers using only two [[digit]]s (usually, 0 and 1). Thus it is a [[base]] 2 numbering system. Example: 10110011<sub>2</sub> = 179<sub>10</sub>
    1 KB (210 words) - 11:16, 22 January 2019
  • Repunit
    ...eing the number referred to as "unity") numbers. 111 is a repunit, in base 2 it is equal to 7 (base 10), in base 3 it is equal to 13 (base 10). A '''Generalized repunit''' for any base {{Vb}} &ge; 2 is defined as
    1 KB (207 words) - 08:04, 12 March 2024
  • Parallel computing
    ...hen a single [[processor]], multiple processors, or multiple cores perform 2 or more operations (similar or different) at once, that is '''parallel comp ! Step !! Input 1 !! Operation !! Input 2 !! Result !! 1440<br>x 365
    3 KB (416 words) - 06:47, 1 May 2019
  • Long multiplication
    ...0. Computers normally use a very similar 'shift and add' algorithm in base 2. [[Prime95]] does not use this form of multiplication for large numbers, us
    2 KB (165 words) - 17:01, 29 August 2022
  • Trial factoring
    ...to use as trial divisors. If P(i) is the i'th prime number so P(1) = 2, P(2) = 3, P(3) = 5, etc, then the last prime factor possibility for some number ...< \sqrt{N}</math>) there is no need to try 7 since 2*7 is excluded because 2 will have been tried, 3*7 is excluded because 3 will have been tried, and 5
    7 KB (1,221 words) - 13:20, 11 February 2019
  • M40
    | foundwith=[[Lucas-Lehmer test]] / [[Prime95]] on 2 GHz Dell Dimension ...hort hand used to refer to the 40th [[Mersenne prime]]. Specifically it is 2<sup>{{Num|20996011}}</sup>-1. This number was discovered to be [[prime]] on
    1 KB (189 words) - 11:17, 18 February 2019
  • Michael Shafer
    '''Michael Shafer''' discovered the [[M40|40th]] [[Mersenne prime]], 2<sup>{{Num|20996011}}</sup>-1 at [[GIMPS]] project.
    660 bytes (88 words) - 00:39, 15 January 2024
  • Josh Findley
    ...nt. He is credited with discovery of the [[M41|41st known Mersenne prime]] 2<sup>{{Num|24036583}}</sup>-1.
    695 bytes (93 words) - 11:46, 14 January 2024
  • M39
    ...hort hand used to refer to the 39th [[Mersenne prime]]. Specifically it is 2<sup>{{Num|13466917}}</sup>-1. This number was discovered to be [[prime]] on
    868 bytes (109 words) - 11:14, 18 February 2019
  • M44
    ...efer to the 44th [[Mersenne prime]]. Currently that designation belongs to 2<sup>{{Num|32582657}}</sup>-1.
    997 bytes (129 words) - 11:35, 18 February 2019
  • M45
    | foundwith=[[Lucas-Lehmer test]] / [[Prime95]] on 2.83 GHz Core 2 Duo [[Personal computer|PC]] '''M45''' normally refers to 2<sup>{{Num|37156667}}</sup>-1, the 45th [[Mersenne prime]] in order of size
    2 KB (251 words) - 11:40, 18 February 2019
  • Odd Magnar Strindmo
    ...way who discovered the [[M46|46th Mersenne prime]] (chronologically 47th), 2<sup>{{Num|42643801}}</sup>-1. Strindmo goes by the alias '''Stig M. Valstad Strindmo's 3 GHz Core 2 Duo PC first reported the prime to GIMPS on 2009-04-12. However, due to a s
    991 bytes (141 words) - 00:33, 15 January 2024

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

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