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 *F*_{n} = 2^{2n} + 1.
It is known that *F*_{0}, *F*_{1}, *F*_{2}, *F*_{3}
and *F*_{4} are primes and all other *F*_{n} 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 *F*_{n} necessarily
has the form *p* = *k* 2^{n + 2} + 1. This project is searching for such factors.

Some years ago I contributed some results to this project.

main page