blob: 01b2d1e07fa1e13b67e93e04e82bb335c79c07d1 (
plain)
1
2
3
4
5
|
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.
|
