235b5b54f2
This program is used to find Mersenne Prime numbers. See http://www.utm.edu/research/primes/mersenne.shtml for a good description of Mersenne primes. Mersenne numbers can be proved composite (not prime) by either finding a factor or by running a Lucas-Lehmer primality test.
5 lines
237 B
Text
5 lines
237 B
Text
$NetBSD: distinfo,v 1.1.1.1 2008/06/02 12:40:48 wiz Exp $
|
|
|
|
SHA1 (mprime2414.tar.gz) = 851220b4e006ef58669c61b47689c4ab4afe7aee
|
|
RMD160 (mprime2414.tar.gz) = c8fd7b96fdb65c45954cb847c45a686e51e2702d
|
|
Size (mprime2414.tar.gz) = 659468 bytes
|