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.
8 lines
241 B
Text
8 lines
241 B
Text
@comment $NetBSD: PLIST,v 1.1.1.1 2008/06/02 12:40:48 wiz Exp $
|
|
bin/mprime
|
|
share/doc/mprime/license.txt
|
|
share/doc/mprime/readme.txt
|
|
share/doc/mprime/stress.txt
|
|
share/doc/mprime/undoc.txt
|
|
share/doc/mprime/whatsnew.txt
|
|
@dirrm share/doc/mprime
|