Apologies to those for whom this page was incorrectly blocked.
I guess it's a prerequisite to know what Generalised Fermat Numbers (GFNs) are, and quite why people are looking for them. For that information, there's no place better than Yves Gallot's GFN Search page. In particular, note that you must use the right program to test these numbers - use "Proth" only for the higher exponents' smaller bases, and use "GeneFer80" for the smaller exponents' larger bases. Yves' site indicates where the cutoffs occur.
We're doing prefiltering so that you don't have to.
I got "primes fatigue" and turned over all of my machines to doing this dirty job. Initally, I was using 15 legacy machines of 200-600 MHz, but I've quit that job and am doing it all on my faster home machines. If you think you can tie up a machine for, say, a month or more, please contact me (see below). It's impossible to throw too much CPU power at this task!
These pages are divided at present into five sections. They are:
And if none of that interests you, perhaps you'd like to hop over to Anna's site, where a variety of weird and in some cases interesting stuff is growing. (Phil will probably remove this bit when he notices it here.)
While my email address can be found elsewhere in these pages, here it is in large, friendly letters:
_ _/ / _ (_ _ _/ / ' / _ / _ / / /) (- / (/ / /) /) / ( (a) (/ (/ /) () () . ( () . (/ /( / /
Another hastily constructed page by Phil Carmody
Home /
Maths /
GFN Sieve /
index.html