Search results

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

• Worktype
  ...ain goals of GIMPS (finding [[Mersenne prime]]s, ensuring that no Mersenne primes have been missed, and lastly finding [[factor]]s for [[Mersenne number]]s). ...chine and with a different [[offset]]. Ensures that a prime was not missed by error.
  4 KB (603 words) - 02:31, 18 August 2019
• PrimeNet server
  ...s taken over by [[Aaron Blosser]], and site maintenance (''Mersenne.org'') by Aaron Blosser and [[James Heinrich]]. ...and both software packages, the range of GIMPS [[exponent]]s being handled by PrimeNet increased from [[79.3 million]] to 999,999,999.
  2 KB (381 words) - 14:05, 21 August 2019
• 100 Million Digit Prefactor Project
  ...and can be used to take exponents to a [[bit level]] higher than practical by using Prime95 alone. Factor5 can be found at: [http://www.moregimps.it/bill The project started with the introduction of 'Factor' by [[Luigi Morelli]]. It was handled using a Geocities website and e-mail. Aft
  3 KB (534 words) - 10:06, 7 March 2019
• 321 Search
  '''''This project is maintained by [[PrimeGrid]] now.''''' These are the simple steps needed to participate in the 321 Search for primes.
  1 KB (185 words) - 09:34, 3 August 2021
• Sieve of Eratosthenes
  ...be <math>2</math>. Since every second number after that will be divisible by <math>2</math>, we cross out every second number; all such numbers are comp ...ry third number which hasn't been crossed out already; these are divisible by <math>3</math> and so are composite.
  4 KB (654 words) - 11:10, 6 February 2019
• Amazon EC2
  ...al computers on which they run their own applications. The service is paid by second hence the term "elastic". Amazon EC2 instances were used to verify record-breaking primes [[M49]] and [[M50]] at the time of their discovery.
  1 KB (155 words) - 11:48, 12 February 2019
• Prime
  ...only '''prime''') is an [[integer]] greater than 1 that is only divisible by itself and 1. The first few prime numbers are 2, 3, 5, 7, 11, 13, 17, 19. ...dea of a 'largest prime' is fiction. And, if there is no largest prime the primes must be infinite.
  2 KB (447 words) - 00:22, 10 July 2023
• Twin prime
  ...rime''' is a [[prime|prime number]] that differs from another prime number by two, for example the twin prime pair (41, 43). ...y twin primes. But it is known that the sum of the reciprocals of all twin primes converges to Brun's constant (about 1.902160583104).
  2 KB (255 words) - 06:08, 21 February 2023
• Riesel Prime Search
  ...sel Prime Search''' (RPS) is a prime searching project established in 2005 by [[Predrag Minovic]] (Kosmaj). :# {{Vk}}-values that can produce many primes in the given range of exponent {{Vn}}
  845 bytes (120 words) - 02:21, 1 May 2024
• Seventeen or Bust/Primes
  These are the [[prime|prime numbers]] found by the [[Seventeen or Bust]] project so far. *[https://primes.utm.edu/primes/search.php All SoB primes]
  2 KB (163 words) - 14:20, 7 March 2019
• 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&times;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

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