| 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 "Mprime (Cray)"
(restored) |
m |
||
| (One intermediate revision by the same user not shown) | |||
| Line 1: | Line 1: | ||
| − | '''mprime''' was the [[ | + | '''mprime''' was the [[software]], initially authored by [[David Slowinski]] (later versions with [[Paul Gage]]), for testing [[Mersenne number]]s for [[Prime|primality]] on [[Cray Research|Cray]] [[Classes of computers#Supercomputer|supercomputer]]s. |
| + | |||
| + | This software is responsible for the discovery of 7 [[Mersenne prime]]s. It used [[Fast Fourier transform]]s for the [[multiplication]] of very large numbers. This represented an advance over the software used by [[Landon Curt Noll]] & [[Laura A. Nickel]]. Noll had suggested the use of FFT's, but had not implemented them until after his discovery of [[M26]]. | ||
[[Category:Software]] | [[Category:Software]] | ||
Latest revision as of 12:02, 7 February 2019
mprime was the software, initially authored by David Slowinski (later versions with Paul Gage), for testing Mersenne numbers for primality on Cray supercomputers.
This software is responsible for the discovery of 7 Mersenne primes. It used Fast Fourier transforms for the multiplication of very large numbers. This represented an advance over the software used by Landon Curt Noll & Laura A. Nickel. Noll had suggested the use of FFT's, but had not implemented them until after his discovery of M26.
