Search results

Create the page "2" on this wiki! See also the search results found.

Page title matches

• Riesel prime 2 1014007
  |Rb=2
  370 bytes (39 words) - 00:06, 17 July 2021
• Riesel prime 2 1006469
  |Rb=2
  359 bytes (39 words) - 00:06, 17 July 2021
• Riesel prime 2 10001
  |Rb=2
  775 bytes (85 words) - 00:10, 17 July 2021
• Riesel prime 2 12201
  |Rb=2
  487 bytes (36 words) - 23:41, 24 July 2021
• Riesel prime 2 10699
  |Rb=2
  354 bytes (29 words) - 00:23, 17 July 2021
• Riesel prime 2 938237
  |Rb=2
  660 bytes (57 words) - 08:09, 25 January 2024
• Riesel prime 2 912189
  |Rb=2
  375 bytes (24 words) - 11:45, 21 July 2021
• Riesel prime 2 36739
  |Rb=2
  413 bytes (32 words) - 20:34, 31 July 2021
• Riesel prime 2 39787
  |Rb=2
  334 bytes (25 words) - 20:36, 31 July 2021
• Riesel prime 2 41197
  |Rb=2
  417 bytes (37 words) - 14:28, 21 July 2021
• Riesel prime 2 56785
  |Rb=2
  409 bytes (32 words) - 10:50, 21 July 2021
• Riesel prime 2 12379
  |Rb=2
  358 bytes (26 words) - 23:44, 24 July 2021
• Riesel prime 2 18885
  |Rb=2 2;T:T
  427 bytes (36 words) - 09:47, 29 July 2021
• Riesel prime 2 22971
  |Rb=2
  359 bytes (29 words) - 07:08, 31 July 2021
• Riesel prime 2 23005
  |Rb=2
  377 bytes (27 words) - 07:09, 31 July 2021
• Riesel prime 2 49363
  |Rb=2
  380 bytes (38 words) - 15:18, 1 August 2021
• Riesel prime 2 71509
  |Rb=2
  378 bytes (28 words) - 12:51, 2 August 2021
• Riesel prime 2 151023
  |Rb=2
  466 bytes (28 words) - 03:44, 26 July 2021
• Riesel prime 2 251749
  |Rb=2
  567 bytes (55 words) - 08:05, 25 January 2024
• Generalized Fermat number 2 1 107
  |GFNa=2
  133 bytes (12 words) - 07:49, 18 September 2021

Page text matches

• Richard Crandall
  His Erdös number is 2. He was one of the primary verifiers of [[M32]], [[M33]], and [[M34]].
  3 KB (431 words) - 11:36, 14 January 2024
• M38
  | top5000id=2 ...hort hand used to refer to the 38th [[Mersenne prime]]. Specifically it is 2^{{{Num|6972593}}}-1. This number was discovered to be [[prime]] on
  1 KB (165 words) - 11:10, 18 February 2019
• Nayan Hajratwala
  ...ers employee from Michigan who discovered the [[M38|38th Mersenne prime]], 2^{{{Num|6972593}}}-1.
  809 bytes (109 words) - 23:55, 14 January 2024
• Coprime
  ...s are coprime with a probability over 60% (the exact number is <math>6/\pi^2</math>).
  738 bytes (112 words) - 09:50, 23 January 2019
• Modular arithmetic
  ...s arithmetic modulo 12 and the set of numbers representing the hours 0, 1, 2, 3,..., 11 is known as <b>Z</b>/12<b>Z</b>. ...</b>/n<b>Z</b> of numbers modulo n contains the numbers 0, 1, 2, 3, ..., n-2 and n-1. The following operations are defined:
  4 KB (625 words) - 10:25, 23 January 2019
• Montgomery multiplication
  ...math>ab\,\equiv \,c\,\pmod{m}</math>. We will also assume that <math>m\,<\,2^n</math>. :<math>a'=2^n\,a\,\bmod{m}</math>.
  4 KB (582 words) - 17:01, 29 August 2022
• Elliptic curve method
  ...iplication|multiplying]] lots of different prime numbers together. So that 2 x 3 x 5 x 7 x 11 x 13 etc will be a highly composite number. But that is on ...,9</math> is a quadratic expression (because the highest power of ''x'' is 2).
  19 KB (3,181 words) - 22:27, 6 July 2023
• M35
  Specifically 2^{{{Num|1398269}}}-1, written out in full [http://www.mersenneforum.
  2 KB (224 words) - 11:00, 18 February 2019
• University of California, Los Angeles
  ...ter]]. Robinson's Mersenne primes were the first to be found in 75 years (2 in the very first day of the run, no less). And he raised the number of dig ...ugust of 2008, a Dell Optplex 745 (running a Intel Core 2 Duo E6600 CPU at 2.4GHz) in the UCLA Math department computer lab, found [[M47|47th Mersenne p
  2 KB (347 words) - 14:54, 19 September 2021
• Raphael M. Robinson
  ...e [[Mersenne number]]s were all composite except for 17 values of ''n'' = 2, 3, 5, 7, 13, 17, 19, 31, 61, 89, 107, [[M12|127]], [[M13|521]], [[M14|607]
  4 KB (526 words) - 14:51, 19 September 2021
• M36
  ...hort hand used to refer to the 36th [[Mersenne prime]], specifically it is 2^{{{Num|2976221}}}-1. This number was dicovered to be [[prime]] on 1 The corresponding [[perfect number]] is 2^{{{Num|2976220}}} &bull; (2^{{{Num|2976221}}}-1). This number is {{Num|1791864}} digits long.
  2 KB (279 words) - 11:01, 18 February 2019
• Sierpiński problem
  |0||1||2||3||4||5||6||7||8||9||10||11||12||13||14||15||16||17||18||19||20||21||22||2 ...th prime 2 24737|24737]], [[Proth prime 2 55459|55459]], and [[Proth prime 2 67607|67607]] (current status [https://www.primegrid.com/stats_sob_llr.php
  5 KB (650 words) - 10:25, 26 March 2024
• Paul Seelhoff
  :Found factor [[Proth prime 2 5|{{Kbn|+|5|2|39}}]] of {{DGF|36}}
  2 KB (195 words) - 00:13, 15 January 2024
• Seventeen or Bust
  The aim of the project is to find [[prime]]s of the form <math>k*2^n+1</math>, where ''k'' is one of the remaining 17 (now 5) candidates for [ |format=,*[[%PAGE%|²{#titleparts:%TITLE%¦1¦2}²]]\n,,
  3 KB (544 words) - 16:44, 21 July 2019
• M2
  | rank= 2 | pdigits= 2
  193 bytes (19 words) - 13:43, 17 February 2019
• M3
  | digits= 2
  194 bytes (19 words) - 13:43, 17 February 2019
• Perfect number
  ...r positive divisors and 1 + 2 + 3 = 6. The next perfect number is 28 = 1 + 2 + 4 + 7 + 14. The next perfect numbers are 496 and 8128. ...irst four perfect numbers are generated by the formula 2^''n''-1(2^''n''-1):
  6 KB (885 words) - 11:33, 7 March 2019
• M9
  The ninth [[Mersenne prime]], 2⁶¹-1 or {{Num|2305843009213693951}}. ...prime number, ([[Édouard Lucas]] having shown earlier that [[M12]], <math>2^{127}-1</math> is also prime), and it remained so until 1911. Prior to the
  2 KB (213 words) - 14:30, 17 February 2019
• Double check
  ...volved 2 independent double checks. [[Mlucas]] and [[Glucas]] are used and 2 different processor types are used. [[Landon Curt Noll]]'s [[Mprime (Cray)|
  2 KB (373 words) - 15:08, 5 June 2019
• Residue
  Here is the Lucas test for <math>2^7-1</math>, which is 127: :S1 = (4 * 4 - 2) mod 127 = 14
  1 KB (235 words) - 10:24, 6 February 2019

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