Search results

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

Page title matches

• List of known Mersenne primes
  *'''#''': number count of the Mersenne primes linked to that prime page *[https://www.mersenne.org/primes/ List of known Mersenne prime numbers] at Mersenne.org
  2 KB (360 words) - 09:44, 6 March 2019
• Seventeen or Bust/Primes
  *[https://primes.utm.edu/primes/search.php All SoB primes]
  2 KB (163 words) - 14:20, 7 March 2019

Page text matches

• Williams prime
  Lists of primes for bases ''b'' and ''n''-values can be found here: ...e included as a separate page.</ref> !! Smallest <ref>The list of smallest primes of any base is an ASCII file for 2 ≤ ''b'' ≤ 1024. For unknown values o
  5 KB (744 words) - 07:30, 5 August 2019
• Carol-Kynea prime 2
  ==History for Carol primes== ==History for Kynea primes==
  5 KB (537 words) - 08:17, 9 October 2020
• Carol-Kynea table
  ...y generated table from available [[:Category:Carol-Kynea prime|Carol-Kynea primes]]. ==Primes table==
  936 bytes (125 words) - 11:11, 11 June 2019
• Examples
  The <b>[[:Category:Carol-Kynea_prime|category]]</b> for Carol/Kynea primes holds example pages for some bases. * field: rieselk_id = 4 (-> "1" = Mersenne primes)
  11 KB (1,236 words) - 14:41, 3 September 2020
• Great Internet Mersenne Prime Search
  Mersenne primes are named after [[Marin Mersenne]], a French monk and mathematician, who wa ...ring the largest Mersenne Primes to date. See the [[list of known Mersenne primes]] for more details.
  3 KB (450 words) - 14:37, 21 August 2019
• List of known Mersenne primes
  *'''#''': number count of the Mersenne primes linked to that prime page *[https://www.mersenne.org/primes/ List of known Mersenne prime numbers] at Mersenne.org
  2 KB (360 words) - 09:44, 6 March 2019
• Mersenne prime
  ...enerally, [[Mersenne number]]s (not necessarily primes, but candidates for primes) are numbers that are one less than a power of two; hence, ...l to the sum of their proper divisors. Historically, the study of Mersenne primes was motivated by this connection; in the 4th century BC [[Euclid]] demonstr
  5 KB (857 words) - 14:53, 19 September 2021
• Leonhard Euler
  ...ant role in opening up new windows onto our understanding, not just of the primes, but in many other areas of mathematics as well.
  16 KB (2,614 words) - 11:48, 14 January 2024
• Marin Mersenne
  ==Mersenne primes== In 1644 he conjectured that the only [[Mersenne prime|Mersenne primes]] less than or equal to M(257) were:<br>M(2), M(3), M(5), M(7), M(13), M(17
  11 KB (1,582 words) - 01:17, 15 January 2024
• Chris Caldwell
  733 bytes (107 words) - 11:27, 14 January 2024
• Landon Curt Noll
  *[http://primes.utm.edu/bios/includes/nollnote.php Entry at] [[The Prime Pages]]
  2 KB (333 words) - 12:40, 9 February 2022
• David Slowinski
  ...that he wrote]]) and has been involved in the discovery of seven Mersenne primes, namely: *[http://primes.utm.edu/bios/page.php?lastname=Slowinski The Prime Pages - David Slowinski]
  1 KB (213 words) - 23:53, 14 January 2024
• Fermat number
  ...ber, and such primes are called '''Fermat primes'''. The only known Fermat primes are {{V|F}}₀,...,{{V|F}}₄. ...he sequence {{{V|p}}_{{Vn}}} is an infinite sequence of distinct primes.
  12 KB (1,913 words) - 14:35, 9 August 2021
• Aaron Blosser
  He is listed as co-discoverer of [[M49]], [[M50]] and [[M51]] Mersenne primes.
  192 bytes (26 words) - 12:04, 21 August 2019
• Derrick Henry Lehmer
  ...'' and the superposition of the corresponding stencils to reveal those few primes having these residues ''R''. ...Lehmer presented data to contradict this conjecture, especially for small primes, and [[Christopher Hooley]] later showed that this follows from the [[Gener
  6 KB (1,033 words) - 01:13, 15 January 2024
• Megaprime
  ...y many natural numbers with less than {{Num|1000000}} digits, "nearly all" primes are megaprimes. ...e [[Mersenne prime]]s. The current list is avalable [http://primes.utm.edu/primes/search.php?MinDigits=1000000&&Number=10000&Style=HTML here].
  806 bytes (111 words) - 07:59, 14 July 2021
• Gigaprime
  ...any natural numbers with less than {{Num|1000000000}} digits, "nearly all" primes are gigaprimes.
  871 bytes (119 words) - 07:54, 14 July 2021
• Base 2 Home Prime Results
  ==Search for Home Primes base 2== ===Table of open Home Primes up to {{Vn}} = {{Num|12000}}===
  2 KB (175 words) - 18:45, 14 December 2023
• Cunningham project
  ...rich prime, satisfying <math>2^{n-1} = 1\ (mod\ n^2)</math>. Only two such primes are known 1093 and 3511, out of a very deep search, and neither of these sq
  7 KB (1,150 words) - 23:48, 19 April 2023
• 2 Minus Tables
  .... Given here links to [[Factoring Database]] in html and text formats. The primes are the [[Mersenne prime]]s. ==Primes for ''n''==
  2 KB (176 words) - 12:01, 13 February 2019
• M25
  ...dates (31 of 75). There was a theory that there was an 'Island of Mersenne Primes'. They were testing this theory and that Tuckerman's discovery of [[M24]] ( *[http://primes.utm.edu/bios/includes/nollnote.php Noll at the Prime Pages]
  2 KB (303 words) - 11:01, 26 February 2019
• Lucas-Lehmer test
  ...ent has order N-1 we must show that it does not have order (N-1)/q for all primes q dividing N-1. Thus, if we know all the factors of N-1, we can prove N pri ...1}\over 2}\omega^{{Q+1}\over 2}</math>. Again, 2 is a quadratic residue of primes congruent to <math>\pm 1</math> mod 8, and <math>Q</math> is of this form,
  20 KB (3,572 words) - 14:30, 17 February 2019
• Factoring Database
  **Inverse home primes of various bases
  1 KB (144 words) - 13:44, 24 January 2019
• Electronic Frontier Foundation
  ...to a special donation, EFF confers [[EFF prizes|prizes]] for finding huge primes. It is expected that these prizes will encourage collaborative computing.
  602 bytes (87 words) - 12:44, 29 January 2019
• Mlucas
  The program was used to verify primes [[M38]], [[M45]], [[M46]], [[M47]], [[M48]], [[M49]], [[M50]] and [[M51]] a
  1 KB (198 words) - 07:28, 22 August 2019
• Ernst Mayer
  2 KB (251 words) - 18:53, 14 December 2023
• M47
  ...mainder being used by GIMPS to provide awards to other finders of Mersenne primes and to cover expenses. *[http://www.math.ucla.edu/~edson/prime/ Edson Smith and primes]
  5 KB (694 words) - 13:17, 21 August 2019
• Prime95
  As of December 2018, Prime95 was used to discover all 17 Mersenne primes found by GIMPS. ==Finding Mersenne primes by distributed computing==
  11 KB (1,586 words) - 12:24, 7 August 2021
• CUDALucas
  The program was used to verify primes [[M48]], [[M49]], [[M50]] and [[M51]] at the times of their discovery.
  2 KB (275 words) - 11:11, 21 August 2019
• Glucas
  ...ersenne number]]s. It is related to [[GIMPS]] effort to search the largest primes ever found. It was written in C by Guillermo Ballester Valor and Klaus Kast Glucas was used to verify [[M41]], [[M43]], [[M46]] and [[M47]] primes at the times of their discovery.
  3 KB (426 words) - 14:21, 14 February 2019
• Distributed computing
  4 KB (674 words) - 12:11, 19 February 2019
• MersenneForum
  ...hers, MersenneForum is used by: <!-- discoverers and verifiers of Mersenne primes, as well as software developers -->
  2 KB (293 words) - 17:33, 5 July 2019
• M34
  ...company or before they joined the company, discovered 10 of the 11 record primes between 1978 and 1996, namely Slowinski, Gage, and [[Landon Curt Noll]] (ei *[http://primes.utm.edu/notes/1257787.html The Prime Pages]
  3 KB (513 words) - 08:42, 18 February 2019
• Paul Gage
  351 bytes (43 words) - 23:51, 14 January 2024
• No Prime Left Behind
  745 bytes (111 words) - 02:17, 1 May 2024
• 2 Plus Tables
  ...[[Factoring Database]] in html and text formats. The primes are the Fermat primes. ==Primes for ''n''==
  2 KB (127 words) - 15:28, 17 August 2019
• Binary
  1 KB (210 words) - 11:16, 22 January 2019
• Repunit
  1 KB (207 words) - 08:04, 12 March 2024
• Mersennewiki
  647 bytes (99 words) - 12:09, 25 February 2019
• Trial factoring
  ...arly for the case of a 32-bit digit size, though now there are 203,280,220 primes to test, and, each one requires 32 bits of storage rather than 16 bits... B ...e <math>2^{32} - 1</math>, would suffice for a sieving process to generate primes as candidate factors up to <math>2^{64}</math> that would suffice to test N
  7 KB (1,221 words) - 13:20, 11 February 2019
• Steven Boone
  512 bytes (71 words) - 11:26, 14 January 2024
• M45
  ...ww.mersenne.org/primes/m45and46.htm GIMPS Discovers 45th and 46th Mersenne Primes] (press release) *[https://www.mersenne.org/primes/Known Mersenne primes] at [[GIMPS]]
  2 KB (251 words) - 11:40, 18 February 2019
• Coprime
  Two [[integer]] numbers are '''coprime''' or relatively primes when their [[greatest common divisor]] is 1 (<math>\gcd{(x,y)} = 1</math>).
  738 bytes (112 words) - 09:50, 23 January 2019
• M35
  ...program]] useful in both in testing PC's and that it could indeed find new primes.
  2 KB (224 words) - 11:00, 18 February 2019
• University of California, Los Angeles
  Prior to the Internet, 7 Mersenne primes were discovered at UCLA ...were the first ever to be found using a [[computer]]. Robinson's Mersenne primes were the first to be found in 75 years (2 in the very first day of the run,
  2 KB (347 words) - 14:54, 19 September 2021
• Raphael M. Robinson
  4 KB (526 words) - 14:51, 19 September 2021
• M36
  ...puter|supercomputer]] by [[David Slowinski]], discoverer of seven Mersenne primes between 1979 and 1996.
  2 KB (279 words) - 11:01, 18 February 2019
• Jonathan Pace
  ...years prior to the discovery. He first became interested in searching for primes in 2003, when he read an article about the discovery of the [[M40|40th know *[https://www.mersenne.org/primes/press/M77232917.html 50th Known Mersenne Prime Discovered] (press release)
  2 KB (242 words) - 00:08, 15 January 2024
• Sierpiński problem
  In early 2002, primes had been found for all but seventeen choices of {{Vk}}. At that point, the
  5 KB (650 words) - 10:25, 26 March 2024
• Paul Seelhoff
  :[https://primes.utm.edu/curios/page.php?curio_id=11327 Prime Curios!] of [[The Prime Pages]
  2 KB (195 words) - 00:13, 15 January 2024

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