 |
 |
 |
Source Code |
 |
|
|
|
|
|
|
|||||
| |||||||||
If you use my source code to find Mersenne primes, you must agree to adhere to the GIMPS prize rules. Other than that restriction, you may use this code as you see fit.
The source code for my program is highly optimized Intel assembly language, there are many more readable FFT algorithms available on the web and in textbooks. The program is also completely non-portable. If you are curious anyway, you can download all the source code(3.6MB). This file includes all the version 24 source code for Windows 95/98/Me, Windows NT/2000/XP, Linux, and FreeBSD. Use the -d option in pkunzip to unzip the source.
My program is very loosely based on C code written by Richard Crandall. Luke Welsh has started a web page that points to Richard Crandall's program and other available source code you can use to help search for Mersenne primes. This is a great place for UNIX users to go.
Last updated: August 9, 2005