Please
email primefinder@hotmail.com
with comments and corrections.
If you are looking for information on what prime numbers are, try
If you are just looking for all the prime numbers, I have posted files containing the first 5,800,000 prime numbers. This is a complete set of all primes from 2 through 100,711,433.
IF you try to download all of them you will find that this site will suddenly stop working. There is a download limit of about 4MB/hour. If you are really interested in small primes and want more than a few million, you can download the program I used to create these. This program will find all the primes from 2 through 2,147,483,647. In case you are wondering that is the first 105,097,565 prime numbers. Small Prime Finder can check about 180 million numbers per hour on a 300MHz Pentium II ®.
And when is the 64 bit version going to be available?
Recently I've been interested in primes of the form K * 2N-1 for K=301 to 999. I try to maintain lists of all the primes that have been found and all the ranges that I am aware have been checked.
If you are also interested in this form of prime you should check out Michael Hartley's site. He maintains a reservation system for searching and a copy of the list of primes. (His site is where I get many of the primes that end up on my list after checking.) The program that I use to find these primes myself was written by Yves Gallot and is called PROTH. It is free and can be found here: I have also found another program written by Torbjörn Alm to be very useful in selecting ranges to be searched. He calls this program CONGPROTH. CongProth computes congurences for numbers of the form h*2^n-1 for any n and h where h is odd. The result can be used to estimate the time it will take to search any given range. Note that this program is only for Woodall numbers. Like PROTH, it is also free.
Please
email primefinder@hotmail.com
with comments and corrections.