| 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 "M46"
(restored) |
m |
||
| Line 1: | Line 1: | ||
| − | '''M46''' is the short hand used to refer to the 46th [[Mersenne prime]] 2<sup>42 | + | '''M46''' is the short hand used to refer to the 46th [[Mersenne prime]] 2<sup>42 643 801</sup>-1. |
| − | The number is [http://www.mersenneforum.org/txt/46.txt 12 | + | The number is [http://www.mersenneforum.org/txt/46.txt 12 837 064 decimal digits] long. After the discovery, Dr. [[Richard Crandall|Crandall]]s company Perfectly Scientific, which developed the FFT algorithm used by GIMPS, made commemorative souvenir posters with all 12.8 million digits printed in a tiny font. |
==Discovery== | ==Discovery== | ||
| − | <math>2^{42 | + | <math>2^{42\,643\,801}{-}1</math> was discovered to be [[prime]] on 2009-04-12 by an IT professional [[Odd Magnar Strindmo]], using [[Prime95]] program written by [[George Woltman]]. Strindmo's computers had been working with [[GIMPS]] since 1996 testing over 1400 candidates. The calculation took 29 days on a 3.0 GHz Intel Core2 processor. |
| − | At time of its discovery, it was the second-largest known | + | At time of its discovery, it was the second-largest known prime number. This prime number was the thirteenth record prime found by the [[GIMPS]] project. |
==Verification== | ==Verification== | ||
| Line 15: | Line 15: | ||
==External links== | ==External links== | ||
*[https://www.mersenne.org/primes/?press=M42643801 GIMPS Discovers 47th Mersenne Prime] (press release) | *[https://www.mersenne.org/primes/?press=M42643801 GIMPS Discovers 47th Mersenne Prime] (press release) | ||
| − | [[Category:Mersenne | + | [[Category:Mersenne prime]] |
Revision as of 22:25, 5 February 2019
M46 is the short hand used to refer to the 46th Mersenne prime 242 643 801-1.
The number is 12 837 064 decimal digits long. After the discovery, Dr. Crandalls company Perfectly Scientific, which developed the FFT algorithm used by GIMPS, made commemorative souvenir posters with all 12.8 million digits printed in a tiny font.
Discovery
[math]\displaystyle{ 2^{42\,643\,801}{-}1 }[/math] was discovered to be prime on 2009-04-12 by an IT professional Odd Magnar Strindmo, using Prime95 program written by George Woltman. Strindmo's computers had been working with GIMPS since 1996 testing over 1400 candidates. The calculation took 29 days on a 3.0 GHz Intel Core2 processor.
At time of its discovery, it was the second-largest known prime number. This prime number was the thirteenth record prime found by the GIMPS project.
Verification
The prime was first verified on June 12th by Tony Reix of Bull SAS in Grenoble, France, using the Glucas program running on Bull NovaScale HPC servers, one featuring Itanium2 CPUs and another featuring Nehalem CPUs.
The prime was later independently verified by Rob Giltrap of Sun Microsystems using Ernst Mayer's Mlucas program running on a Sun SPARC Enterprise M9000 Server.
External links
- GIMPS Discovers 47th Mersenne Prime (press release)
