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

Difference between revisions of "M46"

From Prime-Wiki
Jump to: navigation, search
(restored)
 
(Crandall)
 
(3 intermediate revisions by the same user not shown)
Line 1: Line 1:
'''M46''' is the short hand used to refer to the 46th [[Mersenne prime]] 2<sup>42.643.801</sup>-1.
+
{{InfoboxMersennePrime
 +
| title=M46
 +
| rank=46
 +
| nvalue=42643801
 +
| top5000id=88847
 +
| digits=12837064
 +
| number=169873516452...765562314751
 +
| pdigits=25674127
 +
| discovery=2009-04-12
 +
| discoverer=[[Odd Magnar Strindmo]]
 +
| foundwith=[[Lucas-Lehmer test]] / [[Prime95]] on 3 GHz Core 2 [[Personal computer|PC]]
 +
| credits=[[George Woltman]] et. al.;[[GIMPS]]
 +
}}
 +
'''M46''' is the short hand used to refer to the 46th [[Mersenne prime]] 2<sup>{{Num|42643801}}</sup>-1.
  
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.
+
The number is [http://www.mersenneforum.org/txt/46.txt {{Num|12837064}} decimal digits] long. After the discovery, Dr. [[Richard E. 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.643.801}{-}1</math> was discovered to be [[Prime number|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.
+
M46 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.
+
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==
 
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 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.
+
The prime was later independently verified by Rob Giltrap of Sun Microsystems using [[Ernst W. Mayer]]'s [[Mlucas]] program running on a Sun [[SPARC]] Enterprise M9000 Server.
  
 
==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 primes]]
+
[[Category:Mersenne prime]]

Latest revision as of 07:07, 17 October 2024

M46
Prime class :
Type : Mersenne prime
Formula : Mn = 2n - 1
Prime data :
Rank : 46
n-value : 42,643,801
Number : 169873516452...765562314751
Digits : 12,837,064
Perfect number : 242,643,800 • (242,643,801-1)
Digits : 25,674,127
Discovery data :
Date of Discovery : 2009-04-12
Discoverer : Odd Magnar Strindmo
Found with : Lucas-Lehmer test / Prime95 on 3 GHz Core 2 PC
Credits : George Woltman et. al.
GIMPS

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. Richard E. 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

M46 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 W. Mayer's Mlucas program running on a Sun SPARC Enterprise M9000 Server.

External links