Search results

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

• Seventeen or Bust/Primes
  *[https://primes.utm.edu/primes/search.php All SoB primes]
  2 KB (163 words) - 14:20, 7 March 2019
• Seventeen or Bust/FAQ
  *[[Seventeen or Bust/Primes|Primes]]: Primes found and open values.
  550 bytes (87 words) - 13:39, 1 February 2019
• Seventeen or Bust/Sieving
  ...still be very pleasing. The drawback of sieving is that you'll never find primes by sieving, like [[Seventeen or Bust/Factoring|factoring]].
  2 KB (363 words) - 13:41, 1 February 2019
• Seventeen or Bust/PRP
  ...his is the part where workers actually find new [[Seventeen or Bust/Primes|primes]]. This is the easiest part of the project.
  888 bytes (145 words) - 13:40, 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 ...s less than the computed square root, this procedure can fail, because all primes less than that value will be marked as composites. But this can be fixed ea
  3 KB (521 words) - 11:14, 6 February 2019
• Sieving program
  ...f numbers of the form k×2ⁿ+/-1) http://www.underbakke.com/primes/
  2 KB (220 words) - 11:42, 7 March 2019
• NewPGen
  *k×n#±1 (twin primes) ...nds of primes you ought to rapidly sieve out any k or n divisible by small primes. Since it works with a large set of numbers and uses fast implementations,
  3 KB (529 words) - 09:32, 7 March 2019
• Sophie Germain prime
  It is not known whether there are infinitely many Sophie Germain primes. ==List of Sophie Germain primes==
  1 KB (171 words) - 04:26, 3 November 2020
• M13
  *[[List of known Mersenne primes]]
  419 bytes (48 words) - 14:50, 19 September 2021
• M14
  *[[List of known Mersenne primes]]
  420 bytes (48 words) - 14:49, 19 September 2021
• M15
  *[[List of known Mersenne primes]]
  430 bytes (49 words) - 14:49, 19 September 2021
• M16
  *[[List of known Mersenne primes]]
  431 bytes (49 words) - 14:49, 19 September 2021
• M17
  *[[List of known Mersenne primes]]
  431 bytes (49 words) - 14:49, 19 September 2021
• M18
  *[[List of known Mersenne primes]]
  415 bytes (47 words) - 22:26, 17 February 2019
• M11
  *[[List of known Mersenne primes]]
  412 bytes (47 words) - 14:23, 17 February 2019
• M10
  *[[List of known Mersenne primes]]
  403 bytes (44 words) - 13:54, 17 February 2019
• Proth prime
  ...e form {{Kbn|+|k|n}} with 2^''n'' > ''k'' are often called Proth primes. *[http://primes.utm.edu/glossary/page.php?sort=ProthPrime Definition from The Prime Glossar
  656 bytes (91 words) - 07:02, 31 August 2020
• Riesel prime
  Although there's no official definition of a '''Riesel prime''' mostly all primes of the form {{Kbn|k|n}} with 2^{{Vn}} > {{Vk}} are called like th *[https://www.mersenneforum.org/showthread.php?t=13180 "Post Top-5000 Primes Here"]: [https://www.mersenneforum.org/showpost.php?p=208696 #1 (2010-03-17
  2 KB (280 words) - 00:37, 25 May 2024
• 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.
  2 KB (326 words) - 10:29, 26 March 2024

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