Fermat numbers: a conjecture and a counterexample
Mathematicians have always dreamed of a formula that produces only prime numbers. In 1640 Fermat thought he had found one.
Five primes in a row Fermat studied numbers of the form
$$F_n=2^{2^n}+1.$$The exponent is a power of 2: $1,2,4,8,16,\ldots$ Computing the first few:
$$F_0=3,\quad F_1=5,\quad F_2=17,\quad F_3=257,\quad F_4=65{,}537.$$All five are prime. Checking $65{,}537$ by hand, trying divisors up to its square root, was already hard work. Fermat wrote to Frénicle de Bessy that he was convinced all numbers of this form were prime, although he admitted he had no proof.