Search results

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

• 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
• Seventeen or Bust
  ...are the largest prime that are not a [[Mersenne prime]]. Six of the eleven primes rest in the Top 100. *[http://www.utm.edu/research/primes/index.html Chris Caldwell's Prime Pages and top rank lists]
  3 KB (544 words) - 16:44, 21 July 2019
• Perfect number
  ...ese assumptions was that since 2, 3, 5, and 7 are precisely the first four primes, the fifth perfect number would be obtained when ''n'' = 11, the fifth prim ...concrete one-to-one association between even perfect numbers and Mersenne primes. This result is often referred to as the "Euclid-Euler Theorem."
  6 KB (885 words) - 11:33, 7 March 2019
• M9
  ...ed so until 1911. Prior to the developement of the Lucas test all Mersenne primes were proved by some form of [[trial factoring]]. Pervushin used the [[Lucas *[http://primes.utm.edu/curios/page.php/2305843009213693951.html Prime curios: 230584300921
  2 KB (213 words) - 14:30, 17 February 2019
• GIMPS clients
  ...ested for primality ("is it a prime?") faster than other sorts of would-be primes of the same magnitude. "Faster" here is still measured in weeks, but that c
  8 KB (1,218 words) - 15:37, 13 August 2020
• Mfakto
  ...or candidates (FCs) are pre-sieved on the CPU. The first <SievePrimes> odd primes are used to sieve the FCs. (relevant for CPU sieving only) ...far we sieve the factor candidates on the GPU. The first <GPUSievePrimes> primes are sieved. This parameter also influences the shared mem requirements (low
  17 KB (2,524 words) - 12:39, 24 January 2019
• Riesel and Proth Prime Database
  380 bytes (59 words) - 14:14, 24 January 2019
• Primality test
  3 KB (501 words) - 05:20, 3 August 2021
• Mprime (Cray)
  639 bytes (92 words) - 12:02, 7 February 2019
• Probable prime
  ...ble primes have different specific conditions. While there may be probable primes that are [[Composite number|composite]] (called [[pseudoprime]]s), the cond
  2 KB (232 words) - 07:28, 12 March 2024
• Pseudoprime
  ...in the RSA encryption system, where each party needs to generate two large primes, possibly with hundreds of decimal digits. Actually testing candidates for
  1 KB (155 words) - 20:32, 25 July 2020
• GIMPS factoring and sieving
  ...mber]]s with prime exponents are eliminated from consideration as possible primes this way, so factoring is an important component of maximizing the work thr
  6 KB (962 words) - 10:08, 7 March 2019

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