Search results

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

• Quadratic residue
  823 bytes (117 words) - 20:11, 26 October 2020
• Ten million digits
  979 bytes (146 words) - 14:23, 6 March 2019
• PSearch
  *[http://primes.utm.edu/bios/page.php?id=437 The Prime Pages Titan Biography]
  1 KB (182 words) - 08:17, 12 July 2020
• Brent-Suyama extension
  Slicker would be to note that all primes > 3 are of form 6k+/-1. Suppose instead that we compute T=S<sup>(6k)<sup>2< ...that it is a [[primorial]]. A larger primorial increases the proportion of primes that pair up, at the cost of having to consider a larger number of congruen
  2 KB (421 words) - 11:51, 28 January 2019
• Self-initializing quadratic sieve
  .../math> where u 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
  10 KB (1,763 words) - 02:56, 12 March 2019
• GeneferCUDA
  362 bytes (48 words) - 09:20, 29 January 2019
• Generalized Fermat prime
  ...&OnList=yes&Number=10&Style=HTML Current Top10] largest generalized Fermat primes at Prime Pages
  372 bytes (49 words) - 13:35, 6 March 2019
• Generalized Fermat number
  In 1985, Dubner for the first time built a list of large primes of the form: b^{2^m}+1, ''b &ge; 2'' and ''m &ge; 1''. ...p.'' 67 (1998), pp. 441-446</ref> for the first time built a list of large primes of the form: a^{2^m}+b^{2^m}, ''b > a &
  5 KB (774 words) - 07:39, 27 May 2024
• PrimeGrid
  :[[PrimeGrid 321 Prime Search|321 Prime Search]] searching for mega primes of the form {{Kbn|±|3|2|n}}. :[[PrimeGrid 27121 Prime Search|27121 Prime Search]] searching for primes of the forms {{Kbn|±|27|2|n}} and {{Kbn|±|121|2|n}}.
  3 KB (458 words) - 10:28, 26 March 2024
• 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).
  4 KB (603 words) - 02:31, 18 August 2019
• PrimeNet server
  ...re forced into service has had important benefits. Since one of the 2 new primes was 10 million decimal digits long, it qualified for one of the [[EFF prize
  2 KB (381 words) - 14:05, 21 August 2019
• 100 Million Digit Prefactor Project
  ...nne prime]] was discovered, interest in working on '''100''' million digit primes picked up sharply. This coupled with new versions of Prime95 and PrimeNet,
  3 KB (534 words) - 10:06, 7 March 2019
• 321 Search
  These are the simple steps needed to participate in the 321 Search for primes. Test your range for primes by using [[LLR]].
  1 KB (185 words) - 09:34, 3 August 2021
• Sieve of Eratosthenes
  There are approximately <math>\sqrt{N}\over{log\sqrt{N}}</math> primes smaller than <math>\sqrt{N}</math>, and for each one we do <math>N</math> t The sieve of Eratosthenes is generally used to generate a list of primes for computation of some sort. For example, one may use it to rapidly genera
  4 KB (657 words) - 01:17, 11 August 2024
• Amazon EC2
  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
  ...dea of a 'largest prime' is fiction. And, if there is no largest prime the primes must be infinite. ...rs must end with either 1 more or 5 more than these digits. Therefore, all primes greater than 2 will end with a 1, 3, 5, 7, or 9, and, since any number endi
  2 KB (447 words) - 00:22, 10 July 2023
• Twin prime
  ...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). ==List of twin primes==
  2 KB (255 words) - 06:08, 21 February 2023
• Twin Prime Search
  826 bytes (100 words) - 11:04, 21 March 2024
• Riesel Prime Search
  :# {{Vk}}-values that can produce many primes in the given range of exponent {{Vn}} :# Low-weight {{Vk}}-values that produce a very small number of primes (opposite to (1) above)
  3 KB (330 words) - 15:18, 3 July 2024
• Nomenclature and notation
  ...h>2^{127}-1</math> or other [[List of known Mersenne primes|known Mersenne primes]] as M61, M127, or such. The reader will generally understand that in case
  3 KB (467 words) - 08:48, 15 May 2024

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