Currently there may be errors shown on top of a page, because of a missing Wiki update (PHP version and extension DPL3).
Navigation
Topics Help • Register • News • History • How to • Sequences statistics • Template prototypes

Search results

Jump to: navigation, search
  • | number=316470269330...166697152511 ...] article. The number now refered to as M47 was actually the 45th Mersenne prime found. [[M45]], [[M46]], and M47 were discovered in the order of M47, M45 (
    5 KB (694 words) - 13:17, 21 August 2019
  • ...], a [[distributed computing]] project dedicated to finding new [[Mersenne prime]] numbers. More specifically, Prime95 refers to the Windows and Mac OS X ve ...Awards]). As such, a user who uses Prime95 to discover a qualifying prime number would not be able to claim the prize directly. A free software package woul
    11 KB (1,586 words) - 12:24, 7 August 2021
  • An '''odd number''' is any [[integer]] that is not divisible by 2. ...expressed in decimal notation, the odd numbers end in 1, 3, 5, 7 or 9. All prime numbers except 2 are odd.
    316 bytes (42 words) - 11:21, 7 March 2019
  • | number=299410429404...882733969407 '''M41''' is the short hand used to refer to the 41st [[Mersenne prime]] 2<sup>{{Num|24036583}}</sup>-1.
    1 KB (203 words) - 11:26, 18 February 2019
  • | number=315416475618...411652943871 '''M43''' is the short hand used to refer to the 43rd [[Mersenne prime]] 2<sup>{{Num|30402457}}</sup>-1.
    1 KB (191 words) - 11:31, 18 February 2019
  • | number=169873516452...765562314751 '''M46''' is the short hand used to refer to the 46th [[Mersenne prime]] 2<sup>{{Num|42643801}}</sup>-1.
    2 KB (248 words) - 11:45, 18 February 2019
  • There are a number of individuals or groups in the fields of science, mathematics, cryptograph ...ernet, to look for extra-terrestrial radio signals, to look for [[Mersenne prime]]s so large that they have more than [[ten million digits]], to find more e
    4 KB (674 words) - 12:11, 19 February 2019
  • | number=122164630061...280577077247 '''M42''' refers to the 42nd [[Mersenne prime]] 2<sup>{{Num|25964951}}</sup>-1.
    934 bytes (118 words) - 11:26, 18 February 2019
  • | number= 3 [[Category:Mersenne prime|M01]]
    193 bytes (19 words) - 13:43, 17 February 2019
  • ...project]] in search for lowest [[Sierpiński number|Sierpiński]]/[[Riesel number|Riesel]] values.}} ...mbination of algebraic and trivial factor(s), or make [[Generalized Fermat number]]'s.
    3 KB (507 words) - 08:29, 29 May 2024
  • Let ''x''<sub>0</sub>, ...., ''x''<sub>''n''-1</sub> be [[complex number]]s. The DFT is defined by the formula ...lar misconception) there are O(''n'' log ''n'') FFTs for all ''n'', even [[prime]] ''n''.
    17 KB (2,684 words) - 18:50, 28 September 2023
  • ...[[CUDA]]-based program written by [[Andrew Thall]] for testing [[Mersenne number]]s for primality. ...l, A. [http://andrewthall.org/papers/gpuMersenne2011MKII.pdf Fast Mersenne Prime Testing on the GPU] (2011)
    2 KB (239 words) - 11:12, 13 February 2019
  • {{InfoboxProgram|workload=[[Lucas-Lehmer test|LL]], [[Probable prime|PRP]]|title=gpuOwL|release=2017|latest=7.2<br>2020-11-01}} ...s a [[OpenCL]]-based program written by Mihai Preda for testing [[Mersenne number]]s for primality.
    1 KB (216 words) - 05:22, 1 December 2020
  • ...upport [[GIMPS]], the broader community of [[Mersenne number]]s, [[prime]] number, and factoring projects. In addition to being the de facto help and support ==Prime number software discussion and development==
    2 KB (293 words) - 17:33, 5 July 2019
  • '''Primo''' is a computer program which tests numbers for [[prime|primality]] using the [[Elliptic Curve Primality Proving]] (ECPP) [[algorit ...ot require a number to be of any specific form. If a number is found to be prime, a [[primality certificate]] is produced, which can be quickly verified.
    1 KB (191 words) - 20:33, 12 May 2020
  • | number=174135906820...328544677887 The '''32nd [[Mersenne prime]]''', both in size (smallest to largest) and in order of discover.
    2 KB (279 words) - 08:35, 18 February 2019
  • | number=129498125604...243500142591 '''M33''' refers to 33rd [[Mersenne prime]] number 2<sup>{{Num|859433}}</sup>-1.
    814 bytes (97 words) - 08:38, 18 February 2019
  • | number=412245773621...976089366527 ...ber {{Num|378632}} [[decimal]] [[digit]]s long. The number was found to be prime in 1996.
    3 KB (513 words) - 08:42, 18 February 2019
  • A '''rational number''' is a [[real number]] which can be written as <math>\frac{a}{b}</math> or <math>a/b</math> wher ...r [[greatest common divisor]]. This operation does not change the rational number represented by the fraction.
    3 KB (541 words) - 15:01, 26 March 2023
  • ...iness' of Mersenne numbers makes calculations in the search for [[Mersenne prime]]s a bit easier.
    1 KB (210 words) - 11:16, 22 January 2019

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