October 1st 2005

Distributed Search for Fermat Number Divisors

main page


Distributed Search for Fermat Number Divisors is an internet project set up to find factors for Fermat numbers.

A Fermat number is a number of the form Fn = 22n + 1. It is known that F0, F1, F2, F3 and F4 are primes and all other Fn for n < 33 are composite There is no more Fermat prime known and heuristic arguments make it unlikely that there are some. Status can be found at http://www.prothsearch.net/fermat.html. It is easy to see that a factor p of the Fermat number Fn necessarily has the form p = k 2n + 2 + 1. This project is searching for such factors.

Some years ago I contributed some results to this project.


main page