Search results

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

• Cunningham project
  ...it is considered the oldest continuously ongoing activity in computational number theory. At this moment three editions of the book about the Cunningham project have been published.
  7 KB (1,150 words) - 23:48, 19 April 2023
• Factoring Database
  **Near Cunningham number
  1 KB (144 words) - 13:44, 24 January 2019
• GIMPS factoring and sieving
  ...a factor than to do the Lucas-Lehmer Test; in fact, over 60% of [[Mersenne number]]s with prime exponents are eliminated from consideration as possible prime ...given Mersenne number up to some predetermined size, usually a prescribed number of bits.
  6 KB (962 words) - 10:08, 7 March 2019
• Special number field sieve
  {{Shortcut|SNFS|Special number field sieve: special-purpose [[factorization]] algorithm.}} ...(SNFS)''' is a special-purpose [[factorization]] algorithm. The [[general number field sieve]] (GNFS) was derived from it.
  1 KB (186 words) - 12:07, 19 February 2019
• Why participate in GIMPS?
  ...nts' approximately 300 BC. His goal was to characterize the even [[perfect number]]s (numbers like 6 and 28 who are equal to the sum of their aliquot divisor ...nhard Euler|Euler]], Landry, [[Édouard Lucas|Lucas]], Catalan, Sylvester, Cunningham, Pepin, Putnam and [[Derrick Henry Lehmer|Lehmer]] (to name a few).
  7 KB (1,252 words) - 09:47, 7 March 2019
• NewPGen
  *k×bⁿ+1, 2k×bⁿ+1 (Cunningham Chain 2nd kind, length 2) *k×bⁿ±1, 2k×bⁿ+1 (mixed twin and Cunningham chain)
  3 KB (529 words) - 09:32, 7 March 2019
• NFSNET
  ...project]] that uses the [[general number field sieve|GNFS]] and [[special number field sieve|SNFS]] [[factorization]] methods to completely factor large num ...e [[factorization]]s completed by NFSNET, all of them [[Cunningham project|Cunningham numbers]], are summarized below.
  4 KB (237 words) - 12:17, 13 February 2019
• Aurifeuillian factor
  ..., ''L'' and ''M'': [http://homes.cerias.purdue.edu/~ssw/cun/pmain1215 Main Cunningham Tables]. At the end of tables 2LM, 3+, 5-, 6+, 7+, 10+, 11+ and 12+ are for (Number = ''F'' * (''C'' - ''D'') * (''C'' + ''D'') = ''F'' * ''L'' * ''M'')
  10 KB (1,257 words) - 08:04, 24 June 2019
• NFS@Home
  ...ey have received enough ECM (and a good enough polynomial is found, if the number is to be factored with GNFS). ...rocedure is run but the numbers usually come from the [[Cunningham_project|Cunningham project]] and Greg runs the post processing himself.
  1 KB (211 words) - 18:52, 23 June 2019
• Paul Leyland
  '''Paul Leyland''' is a British [[number theory|number theorist]] who has studied [[factorization]] and [[primality test]]ing. ...numbers of the form <math>x^y + y^x</math>, which are now called [[Leyland number]]s.
  839 bytes (122 words) - 20:22, 19 July 2019
• Homogeneous Cunningham M 11 5 281
  {{DISPLAYTITLE:Homogeneous Cunningham number 11²⁸¹ - 5²⁸¹}} Number: [https://www.mersenneforum.org/showpost.php?p=547092&postcount=42 11<sup>2
  923 bytes (93 words) - 13:34, 15 June 2020