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 |
M25
M25 | |
---|---|
Prime class : | |
Type : | Mersenne prime |
Formula : | M_{n} = 2^{n} - 1 |
Prime data : | |
Rank : | 25 |
n-value : | 21,701 |
Number : | 448679166119...353511882751 |
Digits : | 6,533 |
Perfect number : | 2^{21,700} • (2^{21,701}-1) |
Digits : | 13,066 |
Discovery data : | |
Date of Discovery : | 1978-10-30 |
Discoverer : | Landon Curt Noll Laura A. Nickel |
Found with : | Lucas-Lehmer test / CDC Cyber 174 |
The 25th Mersenne prime, in order from smallest to largest and in order of discovery.
M25 is 2^{21,701}-1, a number of 6,533 digits.
Two high school students, Landon Curt Noll and Laura A. Nickel (later Ariel Glenn) who were studying number theory California State University, East Bay (while still in high school) with Dr. Derrick Henry Lehmer of University of California, Berkeley and Dr. Jurca of CSUH, programmed (in assembly language) the University's CDC Cyber 174 mainframe computer to perform the Lucas-Lehmer test for primality. They consulted work previously done by Gillies and Tuckerman. This showed that all candidate exponents up to M(21000) had been tested. They consulted Wagstaff's factor table to eliminate more candidates (31 of 75). There was a theory that there was an 'Island of Mersenne Primes'. They were testing this theory and that Tuckerman's discovery of M24 (2^{19,937}-1) was the start of this island.
On 1978-10-30, after a testing time (for this number alone) of 7 hours, 40 minutes and 20 seconds, 2^{21,701}-1 was shown to have residue of 0 (zero) at the end of the L-L test, meaning that it is prime. This result was verified by Tuckerman of IBM's Watson Research Center and by Lehmer at UC Berkeley.
After the discovery of the prime, they as a team tested no more candidates, although Noll continued alone (discovering M26) and reworked the program.