Search results

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

• The Prime Pages
  ...of [[prime]]s. It was created by [[Chris Caldwell]] in 1994 and maintained by him until 2023. *[https://t5k.org/primes/status.php Prime Verification Status]
  527 bytes (83 words) - 22:28, 29 April 2024
• M26
  ...h known [[Mersenne prime]] 2^{{{Num|23209}}}-1 found on 1979-02-09 by [[Landon Curt Noll]]. *[[List of known Mersenne primes]]
  455 bytes (52 words) - 23:01, 17 February 2019
• Introductory stuff
  ...zen bytes of information. In fact, it is possible to "check out" exponents by e-mail. Bandwidth is not likely to be a limiting factor for GIMPS. ...t, since the use of PrimeNet is not mandatory and those getting candidates by hand can try them out.
  14 KB (2,370 words) - 15:15, 17 August 2019
• What use are prime numbers anyway?
  ...or good or ill, the least difference to the amenity of the world. - Judged by all practical standards, the value of my mathematical life is nil." By which he meant that unlike say, a physicist or a chemist, his work could no
  3 KB (497 words) - 07:17, 22 May 2020
• Help:Glossary
  *'''[[Mersenne prime]]''' - Primes of the type <math>2^n-1</math> (implying n is also prime). *'''[[Prime|Prime number]]''' - Numbers only divisible by 1 and the number itself.
  1 KB (190 words) - 08:32, 15 May 2024
• Overclocking
  The actual speed of the processor is controlled by switches settings on the motherboard or software controlled switches in the ...otherboards will have temperature monitoring capabilities that can be read by suitable software (see the paragraph about tools). Download, install and us
  14 KB (2,326 words) - 15:17, 11 February 2019
• Multiple polynomial quadratic sieve
  ...<math>u</math> is the product of small [[prime]] numbers. The set of these primes is the ''factor base''. These relations will be found using [[sieving]] as ...th> modulo any prime of the factor base. This means that about half of the primes cannot be in the factor base because <math>N</math> cannot be a [[quadratic
  6 KB (1,068 words) - 14:33, 13 February 2019
• Template:InfoboxMersennePrime
  *'''nvlaue''': link to [[The Prime Pages]] done by given Top5000 ID. ...igits''': link to the Mersenne number with full digits given is determined by:
  4 KB (469 words) - 05:29, 7 October 2021
• GIMPS PrimeNet reports
  ...rs#supercomputer|supercomputer's]] operating status, automatically updated by the server every hour, at the start of the hour. It also shows the current ...st also includes factors found for exponents already known to be composite by way of a [[Lucas-Lehmer test]]. The list generally has more than a full day
  7 KB (1,137 words) - 15:30, 13 August 2020
• Sierpiński-Riesel Base 5
  ...Project''' is a [[distributed computing project]]. It was formerly managed by users of mersenneforum.org, and is currently a subproject on [[PrimeGrid]]. ...e smallest possible [[Riesel number base 5]]. To prove this, one must find primes for all {{Vk}} below the smallest known number.
  2 KB (231 words) - 11:42, 5 October 2020
• 15k Search
  :In order to do this we use the fastest programs possible to return primes of special forms. :15k was the first such form exploited by our group, for it's heavy candidate density.
  3 KB (517 words) - 14:51, 15 February 2019
• PrimeNet summary report
  ...rs#Supercomputer|supercomputer]]'s operating status, automatically updated by the server every hour, at the start of the hour. It also shows the current Broken down by activity in the past 24 hours, 7 days, and 30 days.
  7 KB (1,073 words) - 08:46, 15 May 2024
• Riesel problem 1
  ...s smaller than {{Num|509203}} that have no known prime. These are reserved by the [[PrimeGrid The Riesel Problem|PrimeGrid Riesel Problem]] search. ...+1</sup>. <ref>[http://www.prothsearch.com/rieselprob.html Riesel problem] by [[Wilfrid Keller]]</ref>
  7 KB (691 words) - 00:28, 25 August 2024
• Tutorial LLR
  #Start LLR by double-clicking on LLR.exe ...ewPGen-file in Input file and choose a name for the Output file (where the primes are reported)
  2 KB (337 words) - 13:24, 20 February 2019
• RMA.NET
  '''RMA.NET''' is a free program written by Shane Findley. ...ftware, can be used by the [[15k Search]], or anyone interested in finding primes.
  2 KB (353 words) - 14:53, 20 February 2019
• Mtsieve
  ...ulti-threaded sieve framework for different [[sieving program]]s developed by [[Mark Rodenkirch]].
  2 KB (338 words) - 06:58, 28 March 2023
• Carol-Kynea prime
  ...y [[Cletus Emmanuel]] starting in 1995, the search for new Carol and Kynea primes is now coordinated in a [[MersenneForum]] thread, and the results are store ...)^2</math> is equal to 1, and thus yields -1 when 2 is subtracted from it. By definition -1 is not prime. If {{Vn}} is negative then <math>(b^n±1)^2</ma
  8 KB (1,172 words) - 00:38, 6 July 2023
• Multifactorial Prime Search
  *[http://mfprimes.cba.pl Search] maintained by [[Marian Otremba]] *[https://www.mersenneforum.org/rogue/multifactorial.html Old search] by [[Mark Rodenkirch]]
  572 bytes (74 words) - 14:47, 20 July 2021
• Template:Riesel prime
  Display of current data for Riesel primes {{Kbn|k|b|n}}, comments will be displayed as references at the bottom. *If {{Vk}}-value is disvisible by 3 &rarr; category [[:Category:Riesel 2 3k-value|Riesel 3k]] is set
  10 KB (1,227 words) - 11:05, 25 March 2024
• Template:Williams prime
  Display of current data for Williams primes, comments will be displayed as references at the bottom. The category [[:Category:Williams prime|Williams prime]] is set by default.
  3 KB (307 words) - 02:06, 17 May 2021

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