Search results

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

• 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

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