Search results

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

• The Prime Pages
  *[https://t5k.org/primes/status.php Prime Verification Status] *[https://t5k.org/primes/ The List of Largest Known Primes Home Page]
  527 bytes (83 words) - 22:28, 29 April 2024
• M26
  *[[List of known Mersenne primes]]
  455 bytes (52 words) - 23:01, 17 February 2019
• Introductory stuff
  ...on-Intel code]] that doesn't even use [[PrimeNet]]. Moreover, new Mersenne primes are rare and anyone can check new ones out at any time. Therefore, such a c ...ouple of weeks. Many Mersenne candidates are multiples of relatively small primes. Trial factoring discovers if there is such a number. If it is, the more ex
  14 KB (2,370 words) - 15:15, 17 August 2019
• What use are prime numbers anyway?
  ...So that if a and b are prime, when a x b = c then a and b are the only two primes that will multiply together to make c. During the 1970s three American scie ...o create this composite number. Since factoring big composite numbers into primes is not a trivial matter, anyone interested in trying to break these codes m
  3 KB (497 words) - 07:17, 22 May 2020
• Overclocking
  ...he GIMPS program that is involved in the search for the very rare Mersenne primes. The very useful, for overclockers, feature of Prime95 is the Torture test,
  14 KB (2,326 words) - 15:17, 11 February 2019
• PRPNet
  Several [[distributed computing]] projects use PRPclient to find primes, including:
  531 bytes (63 words) - 13:36, 5 November 2023
• MasterPrime 2006
  416 bytes (52 words) - 15:11, 7 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
• 27121 Search
  ...7121 Search has currently 12 primes in the [[The Prime Pages]]. The bigger primes are 27 &times; 2^1902689-1 and 27 &times; 2^2218064+1,
  983 bytes (138 words) - 13:25, 8 February 2019
• 12121 Search
  ...[[prime]]s of the form: 121 &times; 2ⁿ-1, it also searches for primes of 121 &times; 2ⁿ+1 after being a partner of [[PrimeGrid]]. The 12121 Search has currently 7 primes in the [[The Prime Pages]], their largest number is 121 &times; 2<sup>20339
  984 bytes (143 words) - 13:30, 8 February 2019
• GIMPS chances of finding a prime number
  ...like a river broadening as it slows down, and there are [[twin prime]]s - primes that are only 2 apart like 612,107 and 612,109 - and this makes matters mor ...east one prime in the gap between your two numbers. But that refers to all primes, whereas GIMPS is only looking for [[Mersenne prime]]s, and Chebyshev's res
  3 KB (593 words) - 10:09, 7 March 2019
• Strong law of small numbers
  ...ble Mersenne number]]s are a good example of this. The first 4 terms yield primes, but factors for next four terms have been found (after a gap of over 80 ye [[Chris Caldwell]] has an excellent page on this [http://primes.utm.edu/glossary/page.php?sort=LawOfSmall here].
  1 KB (197 words) - 15:02, 11 February 2019
• GIMPS PrimeNet reports
  '''Known Primes''' links to Chris [[Chris Caldwell]]'s "Prime Pages" table of known [[Merse
  7 KB (1,137 words) - 15:30, 13 August 2020
• Sierpiński-Riesel Base 5
  ...e smallest possible [[Riesel number base 5]]. To prove this, one must find primes for all {{Vk}} below the smallest known number. ...test (for primality). After that, users unreserve their {{Vk}} again if no primes are found. Instructions to the project can be found at [http://www.geocitie
  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. ...nes, written by Paul Jobling, novice users will be more likely to look for primes, and will find them quicker.
  3 KB (517 words) - 14:51, 15 February 2019
• Milestones report
  2 KB (298 words) - 12:39, 19 February 2019
• PrimeNet summary report
  ...in this column will not change, since it is trivial to find and count all primes in these ranges. *'''P''': The number of Mersenne primes found (so far and verified) in this range.
  7 KB (1,073 words) - 08:46, 15 May 2024
• GIMPS milestones
  ...M36]] = M(2976221) and [[M37]] = M(3021377) are the 36th and 37th Mersenne primes. ...[[M32]] = M(756839) and [[M33]] = M(859433) are the 32nd and 33rd Mersenne primes.
  5 KB (691 words) - 08:59, 20 February 2019
• Riesel problem 1
  |+First primes for odd Riesel {{Vk}}-values < {{Num|509203}}<br>by power-of-two range {{Navbox Riesel primes}}
  6 KB (689 words) - 18:14, 4 April 2024
• Tutorial LLR
  ...ewPGen-file in Input file and choose a name for the Output file (where the primes are reported) ...(the icon changes from red to green). You can check the primes.log for new primes if you want.
  2 KB (337 words) - 13:24, 20 February 2019

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