Primarily Primes

I am Chris Chatfield of the U.K. Here you will find details of my prime number searches.

Fixed FFT Length Riesel Prime Searching

I am currently testing k*2^n-1 with variable k and semi-fixed n. (n has a typical range of 16.) I am using a technique that holds the FFT length to a certain size, so all tests take the same time even as k grows. It results in a typical time saving of 40-80% over fixed-n testing of a large range of k.

Also, by carefully choosing n to be just below FFT length changes for the range of k, the primes found are of maximum size for the time taken.

By using these techniques it is possible to find primes approximately twice as fast as just using normal fixed-n searching.

My results so far can be found at:

http://primes.utm.edu/bios/page.php?id=738