List of Mersenne primes and perfect numbers

From HandWiki
Short description: None

Cuisenaire rods showing the proper divisors of 6 (1, 2, and 3) adding up to 6
Visualization of 6 as a perfect number
A graph plotting years on the x-axis with the number of digits of the largest known prime logarithmically on the y-axis, with two trendlines
Logarithmic graph of the number of digits of the largest known prime by year, nearly all of which have been Mersenne primes

Mersenne primes and perfect numbers are two deeply interlinked types of natural numbers in number theory. Mersenne primes, named after the friar Marin Mersenne, are prime numbers that can be expressed as 2p − 1 for some positive integer p. For example, 3 is a Mersenne prime as it is a prime number and is expressible as 22 − 1.[1][2] The numbers p corresponding to Mersenne primes must themselves be prime, although not all primes p lead to Mersenne primes—for example, 211 − 1 = 2047 = 23 × 89.[3] Meanwhile, perfect numbers are natural numbers that equal the sum of their positive proper divisors, which are divisors excluding the number itself. So, 6 is a perfect number because the proper divisors of 6 are 1, 2, and 3, and 1 + 2 + 3 = 6.[2][4]

There is a one-to-one correspondence between the Mersenne primes and the even perfect numbers. This is due to the Euclid–Euler theorem, partially proved by Euclid and completed by Leonhard Euler: even numbers are perfect if and only if they can be expressed in the form 2p − 1 × (2p − 1), where 2p − 1 is a Mersenne prime. In other words, all numbers that fit that expression are perfect, while all even perfect numbers fit that form. For instance, in the case of p = 2, 22 − 1 = 3 is prime, and 22 − 1 × (22 − 1) = 2 × 3 = 6 is perfect.[1][5][6]

It is currently an open problem as to whether there are an infinite number of Mersenne primes and even perfect numbers.[2][6] The frequency of Mersenne primes is the subject of the Lenstra–Pomerance–Wagstaff conjecture, which states that the expected number of Mersenne primes less than some given x is (eγ / log 2) × log log x, where e is Euler's number, γ is Euler's constant, and log is the natural logarithm.[7][8][9] It is also not known if any odd perfect numbers exist; various conditions on possible odd perfect numbers have been proven, including a lower bound of 101500.[10]

The following is a list of all currently known Mersenne primes and perfect numbers, along with their corresponding exponents p. (As of 2023), there are 51 known Mersenne primes (and therefore perfect numbers), the largest 17 of which have been discovered by the distributed computing project Great Internet Mersenne Prime Search, or GIMPS.[2] New Mersenne primes are found using the Lucas–Lehmer test (LLT), a primality test for Mersenne primes that is efficient for binary computers.[2]

The displayed ranks are among indices currently known (As of 2022); while unlikely, ranks may change if smaller ones are discovered. According to GIMPS, all possibilities less than the 48th working exponent p = 57,885,161 have been checked and verified (As of January 2024).[11] The discovery year and discoverer are of the Mersenne prime, since the perfect number immediately follows by the Euclid–Euler theorem. Discoverers denoted as "GIMPS / name" refer to GIMPS discoveries with hardware used by that person. Later entries are extremely long, so only the first and last six digits of each number are shown.

Table of all 51 currently-known Mersenne primes and corresponding perfect numbers
Rank p Mersenne prime Mersenne prime digits Perfect number Perfect number digits Discovery Discoverer Method Ref.[12]
1 2 3 1 6 1 100Ancient times[lower-alpha 1] Known to Ancient Greek mathematicians Unrecorded
2 3 7 1 28 2 [13][14][15]
3 5 31 2 496 3 [13][14][15]
4 7 127 3 8128 4 [13][14][15]
5 13 8191 4 33550336 8 Anonymous[lower-alpha 2] Trial division [14][15]
6 17 131071 6 8589869056 10 1588[lower-alpha 3] Pietro Cataldi
7 19 524287 6 137438691328 12 [2][17]
8 31 2147483647 10 230584...952128 19 1772 Leonhard Euler Trial division with modular restrictions
9 61 230584...693951 19 265845...842176 37 November 1883 Ivan Pervushin Lucas sequences [18]
10 89 618970...562111 27 191561...169216 54 June 1911 Ralph Ernest Powers
11 107 162259...288127 33 131640...728128 65 June 1, 1914 [19]
12 127 170141...105727 39 144740...152128 77 January 10, 1876 Édouard Lucas
13 521 686479...057151 157 235627...646976 314 January 30, 1952 Raphael M. Robinson LLT on SWAC [20]
14 607 531137...728127 183 141053...328128 366 [20]
15 1,279 104079...729087 386 541625...291328 770 June 25, 1952 [21]
16 2,203 147597...771007 664 108925...782528 1,327 October 7, 1952 [22]
17 2,281 446087...836351 687 994970...915776 1,373 October 9, 1952 [22]
18 3,217 259117...315071 969 335708...525056 1,937 September 8, 1957 Hans Riesel LLT on BESK
19 4,253 190797...484991 1,281 182017...377536 2,561 November 3, 1961 Alexander Hurwitz LLT on IBM 7090 [23]
20 4,423 285542...580607 1,332 407672...534528 2,663 [23]
21 9,689 478220...754111 2,917 114347...577216 5,834 May 11, 1963 Donald B. Gillies LLT on ILLIAC II
22 9,941 346088...463551 2,993 598885...496576 5,985 May 16, 1963 [24]
23 11,213 281411...392191 3,376 395961...086336 6,751 June 2, 1963 [24]
24 19,937 431542...041471 6,002 931144...942656 12,003 March 4, 1971 Bryant Tuckerman LLT on IBM 360/91
25 21,701 448679...882751 6,533 100656...605376 13,066 October 30, 1978 Landon Curt Noll & Laura Nickel LLT on CDC Cyber 174
26 23,209 402874...264511 6,987 811537...666816 13,973 February 9, 1979 Landon Curt Noll [25]
27 44,497 854509...228671 13,395 365093...827456 26,790 April 8, 1979 Harry L. Nelson & David Slowinski LLT on Cray-1
28 86,243 536927...438207 25,962 144145...406528 51,924 September 25, 1982 David Slowinski [26]
29 110,503 521928...515007 33,265 136204...862528 66,530 January 29, 1988 Walter Colquitt & Luke Welsh LLT on NEC SX-2 [27][28]
30 132,049 512740...061311 39,751 131451...550016 79,502 September 19, 1983 David Slowinski et al. (Cray) LLT on Cray X-MP [29]
31 216,091 746093...528447 65,050 278327...880128 130,100 September 1, 1985 LLT on Cray X-MP/24 [30][31]
32 756,839 174135...677887 227,832 151616...731328 455,663 February 17, 1992 LLT on Harwell Lab's Cray-2 [32]
33 859,433 129498...142591 258,716 838488...167936 517,430 January 4, 1994 LLT on Cray C90 [33]
34 1,257,787 412245...366527 378,632 849732...704128 757,263 September 3, 1996 LLT on Cray T94 [34][35]
35 1,398,269 814717...315711 420,921 331882...375616 841,842 November 13, 1996 GIMPS / Joel Armengaud LLT / Prime95 on 90 MHz Pentium PC [36]
36 2,976,221 623340...201151 895,932 194276...462976 1,791,864 August 24, 1997 GIMPS / Gordon Spence LLT / Prime95 on 100 MHz Pentium PC [37]
37 3,021,377 127411...694271 909,526 811686...457856 1,819,050 January 27, 1998 GIMPS / Roland Clarkson LLT / Prime95 on 200 MHz Pentium PC [38]
38 6,972,593 437075...193791 2,098,960 955176...572736 4,197,919 June 1, 1999 GIMPS / Nayan Hajratwala LLT / Prime95 on IBM Aptiva with 350 MHz Pentium II processor [39]
39 13,466,917 924947...259071 4,053,946 427764...021056 8,107,892 November 14, 2001 GIMPS / Michael Cameron LLT / Prime95 on PC with 800 MHz Athlon T-Bird processor [40]
40 20,996,011 125976...682047 6,320,430 793508...896128 12,640,858 November 17, 2003 GIMPS / Michael Shafer LLT / Prime95 on Dell Dimension PC with 2 GHz Pentium 4 processor [41]
41 24,036,583 299410...969407 7,235,733 448233...950528 14,471,465 May 15, 2004 GIMPS / Josh Findley LLT / Prime95 on PC with 2.4 GHz Pentium 4 processor [42]
42 25,964,951 122164...077247 7,816,230 746209...088128 15,632,458 February 18, 2005 GIMPS / Martin Nowak [43]
43 30,402,457 315416...943871 9,152,052 497437...704256 18,304,103 December 15, 2005 GIMPS / Curtis Cooper & Steven Boone LLT / Prime95 on PC at University of Central Missouri [44]
44 32,582,657 124575...967871 9,808,358 775946...120256 19,616,714 September 4, 2006 [45]
45 37,156,667 202254...220927 11,185,272 204534...480128 22,370,543 September 6, 2008 GIMPS / Hans-Michael Elvenich LLT / Prime95 on PC [46]
46 42,643,801 169873...314751 12,837,064 144285...253376 25,674,127 June 4, 2009[lower-alpha 4] GIMPS / Odd Magnar Strindmo LLT / Prime95 on PC with 3 GHz Intel Core 2 processor [47]
47 43,112,609 316470...152511 12,978,189 500767...378816 25,956,377 August 23, 2008 GIMPS / Edson Smith LLT / Prime95 on Dell OptiPlex PC with Intel Core 2 Duo E6600 processor [46][48][49]
48 57,885,161 581887...285951 17,425,170 169296...130176 34,850,340 January 25, 2013 GIMPS / Curtis Cooper LLT / Prime95 on PC at University of Central Missouri [50][51]
* 66,674,137 Lowest unverified milestone[lower-alpha 5]
49[lower-alpha 6] 74,207,281 300376...436351 22,338,618 451129...315776 44,677,235 January 7, 2016[lower-alpha 7] GIMPS / Curtis Cooper LLT / Prime95 on PC with Intel Core i7-4790 processor [52][53]
50[lower-alpha 6] 77,232,917 467333...179071 23,249,425 109200...301056 46,498,850 December 26, 2017 GIMPS / Jonathan Pace LLT / Prime95 on PC with Intel Core i5-6600 processor [54][55]
51[lower-alpha 6] 82,589,933 148894...902591 24,862,048 110847...207936 49,724,095 December 7, 2018 GIMPS / Patrick Laroche LLT / Prime95 on PC with Intel Core i5-4590T processor [56][57]
* 115,066,813 Lowest untested milestone[lower-alpha 5]

Historically, the largest known prime number has often been a Mersenne prime.

Notes

  1. ↑ The first four perfect numbers were documented by Nicomachus circa 100, and the concept was known (along with corresponding Mersenne primes) to Euclid at the time of his Elements. There is no record of discovery.
  2. ↑ Found in an anonymous manuscript, Clm 14908, dated 1456 and 1461[14][16]
  3. ↑ Cite error: Invalid <ref> tag; no text was provided for refs named arab
  4. ↑ M42,643,801 was first reported to GIMPS on April 12, 2009 but was not noticed by a human until June 4, 2009 due to a server error.
  5. ↑ 5.0 5.1 (As of January 2024)[11]
  6. ↑ 6.0 6.1 6.2 It has not been verified whether any undiscovered Mersenne primes exist between the 48th (M57,885,161) and the 51st (M82,589,933) on this table; the ranking is therefore provisional.
  7. ↑ M74,207,281 was first reported to GIMPS on September 17, 2015 but was not noticed by a human until January 7, 2016 due to a server error.

References

  1. ↑ 1.0 1.1 Stillwell, John (2010). Mathematics and Its History. Undergraduate Texts in Mathematics. Springer Science+Business Media. pp. 40. ISBN 978-1-4419-6052-8. https://books.google.com/books?id=V7mxZqjs5yUC&pg=PA40. Retrieved 13 October 2021. 
  2. ↑ 2.0 2.1 2.2 2.3 2.4 2.5 Caldwell, Chris K.. "Mersenne Primes: History, Theorems and Lists". https://primes.utm.edu/mersenne/. 
  3. ↑ Caldwell, Chris K.. "If 2n-1 is prime, then so is n". https://primes.utm.edu/notes/proofs/Theorem2.html. 
  4. ↑ Prielipp, Robert W. (1970). "Perfect Numbers, Abundant Numbers, and Deficient Numbers". The Mathematics Teacher 63 (8): 692–96. doi:10.5951/MT.63.8.0692. http://www.jstor.org/stable/27958492. Retrieved 13 October 2021. 
  5. ↑ Caldwell, Chris K.. "Characterizing all even perfect numbers". https://primes.utm.edu/notes/proofs/EvenPerfect.html. 
  6. ↑ 6.0 6.1 Crilly, Tony (2007). "Perfect numbers". 50 mathematical ideas you really need to know. Quercus Publishing. ISBN 978-1-84724-008-8. https://books.google.com/books?id=f46JAwAAQBAJ. Retrieved 13 October 2021. 
  7. ↑ Caldwell, Chris K.. "Heuristics Model for the Distribution of Mersennes". https://primes.utm.edu/mersenne/heuristic.html. 
  8. ↑ Wagstaff, Samuel S. (January 1983). "Divisors of Mersenne numbers" (in en). Mathematics of Computation 40 (161): 385–397. doi:10.1090/S0025-5718-1983-0679454-X. ISSN 0025-5718. http://www.ams.org/jourcgi/jour-getitem?pii=S0025-5718-1983-0679454-X. 
  9. ↑ Pomerance, Carl (September 1981). "Recent developments in primality testing" (in en). The Mathematical Intelligencer 3 (3): 97–105. doi:10.1007/BF03022861. ISSN 0343-6993. https://link.springer.com/content/pdf/10.1007/BF03022861.pdf. 
  10. ↑ Ochem, Pascal; Rao, Michaël (30 January 2012). "Odd perfect numbers are greater than 101500" (in en). Mathematics of Computation 81 (279): 1869–1877. doi:10.1090/S0025-5718-2012-02563-4. ISSN 0025-5718. http://www.ams.org/jourcgi/jour-getitem?pii=S0025-5718-2012-02563-4. 
  11. ↑ 11.0 11.1 "GIMPS Milestones Report". https://www.mersenne.org/report_milestones/. 
  12. ↑ Sources applying to almost all entries:
  13. ↑ 13.0 13.1 13.2 Cite error: Invalid <ref> tag; no text was provided for refs named el
  14. ↑ 14.0 14.1 14.2 14.3 14.4 Cite error: Invalid <ref> tag; no text was provided for refs named hist
  15. ↑ 15.0 15.1 15.2 15.3 Cite error: Invalid <ref> tag; no text was provided for refs named DES
  16. ↑ "'Calendarium ecclesiasticum – BSB Clm 14908'". https://www.digitale-sammlungen.de/en/view/bsb00103422?page=,1. 
  17. ↑ Cite error: Invalid <ref> tag; no text was provided for refs named Cat
  18. ↑ "Sur un nouveau nombre premier, annoncé par le père Pervouchine" (in fr). Bulletin de l'Académie impériale des sciences de St.-Pétersbourg 31: 532–533. 27 January 1887. https://www.biodiversitylibrary.org/page/34669913. Retrieved 13 October 2021. 
  19. ↑ "Records of Proceedings at Meetings". Proceedings of the London Mathematical Society s2-13 (1): iv-xl. 1914. doi:10.1112/plms/s2-13.1.1-s. 
  20. ↑ 20.0 20.1 "Notes" (in en). Mathematics of Computation 6 (37): 58–61. January 1952. doi:10.1090/S0025-5718-52-99405-2. ISSN 0025-5718. https://www.ams.org/mcom/1952-06-037/S0025-5718-52-99405-2/. Retrieved 13 October 2021. 
  21. ↑ "Notes" (in en). Mathematics of Computation 6 (39): 204–205. July 1952. doi:10.1090/S0025-5718-52-99389-7. ISSN 0025-5718. http://www.ams.org/jourcgi/jour-getitem?pii=S0025-5718-52-99389-7. 
  22. ↑ 22.0 22.1 "Notes" (in en). Mathematics of Computation 7 (41): 67–72. January 1953. doi:10.1090/S0025-5718-53-99372-7. ISSN 0025-5718. https://www.ams.org/mcom/1953-07-041/S0025-5718-53-99372-7/. 
  23. ↑ 23.0 23.1 Hurwitz, Alexander (April 1962). "New Mersenne primes" (in en). Mathematics of Computation 16 (78): 249–251. doi:10.1090/S0025-5718-1962-0146162-X. ISSN 0025-5718. http://www.ams.org/jourcgi/jour-getitem?pii=S0025-5718-1962-0146162-X. 
  24. ↑ 24.0 24.1 Cite error: Invalid <ref> tag; no text was provided for refs named autogenerated3
  25. ↑ Cite error: Invalid <ref> tag; no text was provided for refs named Noll & Nickel 1980
  26. ↑ "Announcements" (in en). The Mathematical Intelligencer 5 (1): 60. March 1983. doi:10.1007/BF03023507. ISSN 0343-6993. http://link.springer.com/10.1007/BF03023507. 
  27. ↑ Peterson, I. (6 February 1988). "Priming for a Lucky Strike". Science News 133 (6): 85. doi:10.2307/3972461. 
  28. ↑ Colquitt, W. N.; Welsh, L. (April 1991). "A new Mersenne prime". Mathematics of Computation 56 (194): 867. doi:10.1090/S0025-5718-1991-1068823-9. Bibcode: 1991MaCom..56..867C. 
  29. ↑ "Number is largest prime found yet.". The Globe and Mail. 24 September 1983. ProQuest 386439660. https://www.proquest.com/docview/386439660. 
  30. ↑ Peterson, I. (28 September 1985). "Prime Time for Supercomputers". Science News 128 (13): 199. doi:10.2307/3970245. 
  31. ↑ Dembart, Lee (17 September 1985). "Supercomputer Comes Up With Whopping Prime Number" (in en-US). Los Angeles Times. https://www.latimes.com/archives/la-xpm-1985-09-17-mn-20124-story.html. 
  32. ↑ Maddox, John (26 March 1992). "The endless search for primality" (in en). Nature 356 (6367): 283. doi:10.1038/356283a0. ISSN 1476-4687. Bibcode: 1992Natur.356..283M. 
  33. ↑ "Largest Known Prime Number Discovered on Cray Research Supercomputer". PR Newswire. 10 January 1994. https://go.gale.com/ps/i.do?p=ITOF&u=wikipedia&id=GALE%7CA14684654&v=2.1&it=r&sid=bookmark-ITOF&asid=b1d68ed5. 
  34. ↑ Caldwell, Chris K.. "A Prime of Record Size! 21257787-1". https://primes.utm.edu/notes/1257787.html. 
  35. ↑ Gillmor, Dan (3 September 1996). "Crunching numbers: Researchers come up with prime math discovery". Knight Ridder. https://link.gale.com/apps/doc/A18635446/ITOF?u=wikipedia&sid=bookmark-ITOF&xid=68c06627. 
  36. ↑ "GIMPS Discovers 35th Mersenne Prime, 21,398,269-1 is now the Largest Known Prime.". Great Internet Mersenne Prime Search. 12 November 1996. https://www.mersenne.org/primes/?press=M1398269. 
  37. ↑ "GIMPS Discovers 36th Mersenne Prime, 22,976,221-1 is now the Largest Known Prime.". Great Internet Mersenne Prime Search. 1 September 1997. https://www.mersenne.org/primes/?press=M2976221. 
  38. ↑ "GIMPS Discovers 37th Mersenne Prime, 23,021,377-1 is now the Largest Known Prime.". Great Internet Mersenne Prime Search. 2 February 1998. https://www.mersenne.org/primes/?press=M3021377. 
  39. ↑ "GIMPS Discovers 38th Mersenne Prime 26,972,593-1 is now the Largest Known Prime.". Great Internet Mersenne Prime Search. 30 June 1999. https://www.mersenne.org/primes/?press=M6972593. 
  40. ↑ "GIMPS Discovers 39th Mersenne Prime, 213,466,917-1 is now the Largest Known Prime.". Great Internet Mersenne Prime Search. 6 December 2001. https://www.mersenne.org/primes/?press=M13466917. 
  41. ↑ "GIMPS Discovers 40th Mersenne Prime, 220,996,011-1 is now the Largest Known Prime.". Great Internet Mersenne Prime Search. 2 February 2003. https://www.mersenne.org/primes/?press=M20996011. 
  42. ↑ "GIMPS Discovers 41st Mersenne Prime, 224,036,583-1 is now the Largest Known Prime.". Great Internet Mersenne Prime Search. 28 May 2004. https://www.mersenne.org/primes/?press=M24036583. 
  43. ↑ "GIMPS Discovers 42nd Mersenne Prime, 225,964,951-1 is now the Largest Known Prime.". Great Internet Mersenne Prime Search. 27 February 2005. https://www.mersenne.org/primes/?press=M25964951. 
  44. ↑ "GIMPS Discovers 43rd Mersenne Prime, 230,402,457-1 is now the Largest Known Prime.". Great Internet Mersenne Prime Search. 24 December 2005. https://www.mersenne.org/primes/?press=M30402457. 
  45. ↑ "GIMPS Discovers 44th Mersenne Prime, 232,582,657-1 is now the Largest Known Prime.". Great Internet Mersenne Prime Search. 11 September 2006. https://www.mersenne.org/primes/?press=M32582657. 
  46. ↑ 46.0 46.1 "GIMPS Discovers 45th and 46th Mersenne Primes, 243,112,609-1 is now the Largest Known Prime.". Great Internet Mersenne Prime Search. 15 September 2008. https://www.mersenne.org/primes/?press=M43112609. 
  47. ↑ "GIMPS Discovers 47th Mersenne Prime". Great Internet Mersenne Prime Search. 12 April 2009. https://www.mersenne.org/primes/?press=M42643801. 
  48. ↑ Maugh, Thomas H. (27 September 2008). "Rare prime number found". Los Angeles Times. https://www.latimes.com/archives/la-xpm-2008-sep-27-sci-prime27-story.html. 
  49. ↑ Smith, Edson. "The UCLA Mersenne Prime". UCLA Mathematics. https://math.ucla.edu/~edson/prime. 
  50. ↑ "GIMPS Discovers 48th Mersenne Prime, 257,885,161-1 is now the Largest Known Prime.". Great Internet Mersenne Prime Search. 5 February 2013. https://www.mersenne.org/primes/?press=M57885161. 
  51. ↑ Yirka, Bob (6 February 2013). "University professor discovers largest prime number to date" (in en). https://phys.org/news/2013-02-university-professor-largest-prime-date.html. 
  52. ↑ "GIMPS Project Discovers Largest Known Prime Number: 274,207,281-1". Great Internet Mersenne Prime Search. 19 January 2016. https://www.mersenne.org/primes/?press=M74207281. 
  53. ↑ "Largest known prime number discovered in Missouri" (in en-GB). BBC News. 20 January 2016. https://www.bbc.com/news/technology-35361090. 
  54. ↑ "GIMPS Project Discovers Largest Known Prime Number: 277,232,917-1". Great Internet Mersenne Prime Search. 3 January 2018. https://www.mersenne.org/primes/?press=M77232917. 
  55. ↑ Lamb, Evelyn (4 January 2018). "Why You Should Care About a Prime Number That's 23,249,425 Digits Long" (in en). https://slate.com/technology/2018/01/the-worlds-largest-prime-number-has-23249425-digits-heres-why-you-should-care.html. 
  56. ↑ "GIMPS Discovers Largest Known Prime Number: 282,589,933-1". Great Internet Mersenne Prime Search. 21 December 2018. https://www.mersenne.org/primes/?press=M82589933. 
  57. ↑ Palca, Joe (21 December 2018). "The World Has A New Largest-Known Prime Number" (in en). NPR. https://www.npr.org/2018/12/21/679207604/the-world-has-a-new-largest-known-prime-number. 

External links



Retrieved from "https://handwiki.org/wiki/index.php?title=List_of_Mersenne_primes_and_perfect_numbers&oldid=3359754"