Search results

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

• Factoring Database
  ...atabase''' is a database of [[factor]]s of numbers of any kind, programmed by Markus Tervooren. **Inverse home primes of various bases
  1 KB (144 words) - 13:44, 24 January 2019
• Mlucas
  ...[Mersenne number]]s, and Pépin tests of [[Fermat number]]s. It is written by [[Ernst Mayer]] using C programming language and [[ARM]] assembly. It also ...er be lucky as to find a new prime eligible for the monetary prize offered by the [[Electronic Frontier Foundation]].
  1 KB (198 words) - 07:28, 22 August 2019
• M47
  On 2018-04-08 all tests below 2^{{{Num|43112609}}}-1 were verified by [[GIMPS]], officially making it the 47th Mersenne prime. ...Bug]] or a random bit error or [[software]], the number had to be verified by running the Lucas-Lehmer test on at least one different machine (not just a
  5 KB (694 words) - 13:17, 21 August 2019
• Prime95
  ...s the freeware computer program written by [[George Woltman]] that is used by [[Great Internet Mersenne Prime Search|GIMPS]], a [[distributed computing]] ...f December 2018, Prime95 was used to discover all 17 Mersenne primes found by GIMPS.
  11 KB (1,586 words) - 12:24, 7 August 2021
• CUDALucas
  '''CUDALucas''' is a [[CUDA]]-based program written by [[Shoichiro Yamada]] for testing [[Mersenne number]]s for primality with [[ ...itself a port to FFTW of a program tracing its roots back to original code by [[Richard Crandall]] et al.[http://www.ece.neu.edu/groups/nucar/GPGPU4/file
  2 KB (275 words) - 11:11, 21 August 2019
• Glucas
  ...IMPS]] effort to search the largest primes ever found. It was written in C by Guillermo Ballester Valor and Klaus Kastents. ...51.pdf "Discrete weighted transforms and large-integer arithmetic"] (1994) by R. Crandall and B. Fagin. The library is coded in C with some assembler mac
  3 KB (426 words) - 14:21, 14 February 2019
• Distributed computing
  ...s a branch of [[computational science]] that tries to solve large problems by giving small parts of the problem to many computers to solve and then combi ...access to massive computing power that would not otherwise be obtainable. By joining one of these distributed computing projects, you can play an import
  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
  ...z machine it took about 60 hours to [[double check]] the number. Woltman, by happenstance, was 95% of the way through a check on that ''very'' number, w ...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
  3 KB (513 words) - 08:42, 18 February 2019
• No Prime Left Behind
  ...} with odd {{Vk}} and 300 < {{Vk}} < 1001 and {{Vn}} > 260000 not reserved by others with highly presieved ranges.
  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
• Mersennewiki
  Using the old database many pages were restored for this new Wiki in 2019 by [[:User:Karbon|Karbon]].
  647 bytes (99 words) - 12:09, 25 February 2019
• Trial factoring
  Such a table can be prepared automatically, usually by an adaption of the [[Sieve of Eratosthenes]], itself requiring a small tabl ...s in using larger digit sizes. Verifying that your CPU functions correctly by testing the add, subtract, multiply and divide operations on all possible p
  7 KB (1,221 words) - 13:20, 11 February 2019
• M45
  M45 was found on 2008-09-06, by a computer owned by [[Hans-Michael Elvenich]] of Germany. The computer was running [[Prime95]] ...ww.mersenne.org/primes/m45and46.htm GIMPS Discovers 45th and 46th Mersenne Primes] (press release)
  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>). ...ath> and thus the [[Modular arithmetic#Modular division|modular division]] by <math>m \pmod{n}</math>.
  738 bytes (112 words) - 09:50, 23 January 2019
• M35
  ...t [[prime]] discovered by [[GIMPS]] and the first [[Mersenne prime]] found by a [[personal computer]]. A little more than a month earlier, [[David Slowin ...mer test]] took 88 hours to run. The primality of the number was confirmed by Slowinski. This showed the effectiveness of [[distributed computing]].
  2 KB (224 words) - 11:00, 18 February 2019
• University of California, Los Angeles
  ...Angeles (UCLA)''' is the largest of the University of California campuses (by enrollment). It is situated in the Westwood area of Los Angeles. It has a l Prior to the Internet, 7 Mersenne primes were discovered at UCLA
  2 KB (347 words) - 14:54, 19 September 2021
• Raphael M. Robinson
  |Name=Raphael Mitchel Robinson ...essentially undecidable theory need not have an infinite number of axioms by coming up with a counterexample: Robinson arithmetic ''Q''. ''Q'' is finite
  4 KB (526 words) - 14:51, 19 September 2021
• M36
  ...be [[prime]] on 1997-08-24 by [[Gordon Spence]], using [[Prime95]] written by [[George Woltman]]. At time of its discovery, it was the largest known prim ...puter|supercomputer]] by [[David Slowinski]], discoverer of seven Mersenne primes between 1979 and 1996.
  2 KB (279 words) - 11:01, 18 February 2019
• Sierpiński problem
  The '''Sierpiński problem''' in [[number theory]] was proposed by [[Wacław Sierpiński]] in 1960. 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

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