Search results

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

• Seventeen or Bust/FAQ
  '''Note:''' You can help expand this list by adding your questions or creating new articles and linking them here. *[[Seventeen or Bust/Primes|Primes]]: Primes found and open values.
  550 bytes (87 words) - 13:39, 1 February 2019
• Seventeen or Bust/Sieving
  ...be very pleasing. The drawback of sieving is that you'll never find primes by sieving, like [[Seventeen or Bust/Factoring|factoring]]. ...hoice is [http://www.aooq73.dsl.pipex.com/sobsieve_1_34.zip SoBSieve 1.34] by Paul Jobling. Be warned, though, that this client is 40% slower than proth_
  2 KB (363 words) - 13:41, 1 February 2019
• Why participate in GIMPS?
  ...://www.utm.edu/research/primes/notes/faq/why.html Why do people find these primes?] ...numbers (no odd perfect numbers are known) are all closely related to the primes of the form 2^p-1, for some prime ''p'' (now called [[Mersenne pr
  7 KB (1,252 words) - 09:47, 7 March 2019
• Sieving
  If we need to find prime numbers, for all primes between 2 and the square root of the maximum member of the sequence, set to ...than that value will be marked as composites. But this can be fixed easily by do not setting that element to 1 if the member of the sequence is equal to
  3 KB (521 words) - 11:14, 6 February 2019
• NewPGen
  '''NewPGen''' is a [[Sieving program|program]] written by Paul Jobling that is used to [[Sieving|sieve]] a set of many candidate numb *k×n#±1 (twin primes)
  3 KB (529 words) - 09:32, 7 March 2019
• M13
  ...is the 13th known [[Mersenne prime]] 2⁵²¹-1 found on 1952-01-30 by [[Raphael M. Robinson]]. *[[List of known Mersenne primes]]
  419 bytes (48 words) - 14:50, 19 September 2021
• M14
  ...is the 14th known [[Mersenne prime]] 2⁶⁰⁷-1 found on 1952-01-30 by [[Raphael M. Robinson]]. *[[List of known Mersenne primes]]
  420 bytes (48 words) - 14:49, 19 September 2021
• M15
  ...th known [[Mersenne prime]] 2^{{Num|1279}}-1 found on 1952-06-25 by [[Raphael M. Robinson]]. *[[List of known Mersenne primes]]
  430 bytes (49 words) - 14:49, 19 September 2021
• M16
  ...th known [[Mersenne prime]] 2^{{Num|2203}}-1 found on 1952-10-07 by [[Raphael M. Robinson]]. *[[List of known Mersenne primes]]
  431 bytes (49 words) - 14:49, 19 September 2021
• M17
  ...th known [[Mersenne prime]] 2^{{Num|2281}}-1 found on 1952-11-09 by [[Raphael M. Robinson]]. *[[List of known Mersenne primes]]
  431 bytes (49 words) - 14:49, 19 September 2021
• M18
  ...th known [[Mersenne prime]] 2^{{Num|3217}}-1 found on 1957-09-08 by [[Hans Riesel]]. *[[List of known Mersenne primes]]
  415 bytes (47 words) - 22:26, 17 February 2019
• M11
  ...s the 11th known [[Mersenne prime]] 2¹⁰⁷-1</math> found in 1914 by [[Ralph Ernest Powers]]. *[[List of known Mersenne primes]]
  412 bytes (47 words) - 14:23, 17 February 2019
• M10
  ...' is the 10th known [[Mersenne prime]] <math>2^{89}-1</math> found in 1911 by [[Ralph Ernest Powers]]. *[[List of known Mersenne primes]]
  403 bytes (44 words) - 13:54, 17 February 2019
• Riesel Sieve
  ...is the smallest possible [[Riesel number]]). To do that, they have to find primes for all the remaining k values to prove that they are not Riesel numbers. ...testing was done independently. As values have been released from testing by individuals, the Riesel Sieve project has taken over testing them.
  2 KB (326 words) - 10:29, 26 March 2024
• 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
• 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

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