Search results

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

• M30
  | number=512740276269...455730061311 [[Category:Mersenne prime]]
  282 bytes (24 words) - 08:28, 18 February 2019
• M31
  | number=746093103064...103815528447 [[Category:Mersenne prime]]
  285 bytes (24 words) - 08:30, 18 February 2019
• Milestones report
  *'''Discovery of new [[Mersenne prime]]s.''' *[[Double check]]ing all numbers less than a given Mersenne Prime, thus proving its place in the sequence of MP's (e.g. 'verifying' that M32
  2 KB (298 words) - 12:39, 19 February 2019
• PrimeNet summary report
  ...of the active machines. Since not all machines are contributing 24/7 this number is not close to 100%. [[Computing power|GHz-days]] and TFLOPS are used. ...in during the period. For the 30 day period, this is higher than the total number in the 'Resources Registered' section, because many assginments take much l
  7 KB (1,073 words) - 08:46, 15 May 2024
• GIMPS milestones
  ...nternet Mersenne Prime Search]] has already discovered thirteen [[Mersenne prime]]s! | 2009-04-12 || '''Prime [[M46]] = M(42643801) discovered!!'''
  5 KB (691 words) - 08:59, 20 February 2019
• Riesel problem 1
  The '''Riesel problem''' involves determining the smallest [[Riesel number]]. ...that {{Kbn|k|2|n}} is not prime for any integer {{Vn}}. He showed that the number {{Vk}} = ''{{Num|509203}}'' has this property.
  6 KB (689 words) - 18:14, 4 April 2024
• Frequently suggested improvements
  ...reduction. Since we square at each step of the [[Lucas-Lehmer test]], the number of digits approximately doubles each time. So after only 50 iterations, the ...ble amount of elapsed time (when [[double check]]ing a supposed [[Mersenne prime]]). In this case SMP variations of the LL test can be used and are used - s
  2 KB (392 words) - 14:37, 20 February 2019
• LL test distribution
  At any given instant, most of [[Great Internet Mersenne Prime Search|GIMPS]]'s LL tests fall roughly into one of 2 categories. As time pa ...ent first time [[Lucas-Lehmer test|LL tests]] are taking place. [[Mersenne prime]] discoveries almost always take place in this range. As of Feb. 2020, most
  2 KB (415 words) - 21:32, 12 February 2020
• Mersenne.ca
  ...ake a large amount of RAM, and have no possibility of finding a [[Mersenne prime]], many GIMPS users purposely skipped the P-1 stage to spend more time doin ...cached for quick access to the "worst" ranges of exponents, where large a number of exponents have been poorly factored. Most options are user-configurable
  9 KB (1,396 words) - 15:42, 25 February 2019
• Cullen number
  A '''Cullen number''' {{V|C_n}} is a number of the form {{Kbn|+|n|2|n}}, a '''generalized Cullen number''' base {{Vb}} is a number of the form {{Kbn|+|n|b|n}}. '''(perhaps own page?)'''
  2 KB (252 words) - 17:39, 31 August 2021
• Mtsieve
  *mfsieve: search for factors of [[Multifactorial number]]s *cksieve: search for factors of [[Carol-Kynea prime]]s
  2 KB (338 words) - 06:58, 28 March 2023
• Available Double-Triple checks
  ...re listed the available [[worktype|double or triple checks]] of [[Mersenne number]]s. [[Category:Great Internet Mersenne Prime Search]]
  703 bytes (67 words) - 21:09, 16 March 2019
• Carol-Kynea prime
  ...rdinated in a [[MersenneForum]] thread, and the results are stored here on Prime-Wiki. ...h>. A Carol/Kynea prime is a [[prime]] which has one of the above forms. A prime of these forms must satisfy the following criteria:
  8 KB (1,172 words) - 00:38, 6 July 2023
• Multifactorial prime
  A '''Multifactorial prime''' is a [[Multifactorial number]] which is prime and of the form <math>\ n!_2{±}1,\ n!_3{±}1,\ n!_4{±}1</math>, and so on *[[Factorial number]]
  429 bytes (50 words) - 14:29, 25 March 2019
• Multifactorial number
  A [[Factorial number]] is defined by the product A '''Multifactorial number''' is denoted by
  560 bytes (81 words) - 14:36, 20 July 2021
• Riesel 2 Low-weight
  include={Riesel prime}:Rk,{Riesel prime}:RCount,{Riesel prime}:RNash,a ...head"|Count!!data-sort-type="number" class="fixhead"|Nash!!data-sort-type="number" class="fixhead"|Max {{Vn}},\n¦-,,\n¦}
  948 bytes (121 words) - 13:08, 21 July 2021
• Factorial prime
  A '''Factorial prime''' is a [[prime]] of the form '''[[Factorial number]] ± 1'''. *[[Multifactorial prime]]
  488 bytes (70 words) - 07:11, 1 April 2019
• Williams prime MM least
  ...or any base {{Vb}} with 2 ≤ {{Vb}} ≤ 2049 which generates a [[Williams prime]] of the form {{Kbn|(b-1)|b|n}}. {{HistF|2019-06-05|23089 ([[Williams prime MM 1801|{{Vb}}=1801]])|Karsten Bonath}}
  2 KB (211 words) - 07:40, 1 August 2021
• Proth prime 2 1
  {{Proth prime |PRemarks=These n-values form the [[Fermat number|Fermat primes]].
  212 bytes (30 words) - 15:35, 2 October 2022
• Proth prime 2 9
  {{Proth prime For all even {{Vn}}-values {{Kbn|+|9|2|n}} is a [[Generalized Fermat number]].<br>
  3 KB (452 words) - 17:06, 9 June 2024

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