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
277 B
Text
5 lines
277 B
Text
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.
|