| Currently there may be errors shown on top of a page, because of a missing Wiki update (PHP version and extension DPL3). |
| Topics | Help • Register • News • History • How to • Sequences statistics • Template prototypes |
Difference between revisions of "M35"
(restored) |
m |
||
| Line 5: | Line 5: | ||
Discovered on 1996-11-13, this was the first [[Prime number|prime]] discovered by [[GIMPS]] and the first [[Mersenne prime]] found by a [[personal computer]]. A little more than a month earlier, [[David Slowinski]] had found the previous Mersenne Prime on a [[Cray Research|Cray]]. This was to be the '''last''' discovered on a [[Classes of computers#Supercomputer|supercomputer]] or a [[Classes of computers#Mainframe computers|mainframe]]. | Discovered on 1996-11-13, this was the first [[Prime number|prime]] discovered by [[GIMPS]] and the first [[Mersenne prime]] found by a [[personal computer]]. A little more than a month earlier, [[David Slowinski]] had found the previous Mersenne Prime on a [[Cray Research|Cray]]. This was to be the '''last''' discovered on a [[Classes of computers#Supercomputer|supercomputer]] or a [[Classes of computers#Mainframe computers|mainframe]]. | ||
| − | [[Joel Armengaud]], then a programmer from France, ran [[Prime95]] on his [[Pentium]] 90Hz [[computer]]. The [[Lucas-Lehmer test]] took 88 hours to run. The [[primality]] of the number was confirmed by Slowinski. This showed the effectiveness of [[distributed computing]]. | + | [[Joel Armengaud]], then a programmer from France, ran [[Prime95]] on his [[Pentium]] 90Hz [[computer]]. The [[Lucas-Lehmer test]] took 88 hours to run. The [[Prime number|primality]] of the number was confirmed by Slowinski. This showed the effectiveness of [[distributed computing]]. |
This the time when the [[Pentium Bug]] was an issue. The fact that Prime95 was critical in uncovering this bug and then shortly there after found a prime, proved the [[program]] useful in both in testing PC's and that it could indeed find new primes. | This the time when the [[Pentium Bug]] was an issue. The fact that Prime95 was critical in uncovering this bug and then shortly there after found a prime, proved the [[program]] useful in both in testing PC's and that it could indeed find new primes. | ||
Revision as of 12:57, 23 January 2019
M35 is the 35th Mersenne prime, both in order of size and date of discovery.
Specifically [math]\displaystyle{ 2^{1398269}-1 }[/math], written out in full 420,921 digits.
Discovered on 1996-11-13, this was the first prime discovered by GIMPS and the first Mersenne prime found by a personal computer. A little more than a month earlier, David Slowinski had found the previous Mersenne Prime on a Cray. This was to be the last discovered on a supercomputer or a mainframe.
Joel Armengaud, then a programmer from France, ran Prime95 on his Pentium 90Hz computer. The Lucas-Lehmer test took 88 hours to run. The primality of the number was confirmed by Slowinski. This showed the effectiveness of distributed computing.
This the time when the Pentium Bug was an issue. The fact that Prime95 was critical in uncovering this bug and then shortly there after found a prime, proved the program useful in both in testing PC's and that it could indeed find new primes.
