# Fermat number

In mathematics, a **Fermat number**, named after Pierre de Fermat who first studied them, is a positive integer of the form

**Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle F_{n} = 2^{2^n} + 1}**

where *n* is a nonnegative integer. The first eight Fermat numbers are (sequence A000215 in OEIS):

*F*_{0}= 2^{1}+ 1 = 3*F*_{1}= 2^{2}+ 1 = 5*F*_{2}= 2^{4}+ 1 = 17*F*_{3}= 2^{8}+ 1 = 257*F*_{4}= 2^{16}+ 1 = 65537*F*_{5}= 2^{32}+ 1 = 4294967297 = 641 × 6700417*F*_{6}= 2^{64}+ 1 = 18446744073709551617 = 274177 × 67280421310721*F*_{7}= 2^{128}+ 1 = 340282366920938463463374607431768211457 = 59649589127497217 × 5704689200685129054721

Only the first 12 Fermat numbers have been completely factorised. These factorisations can be found at Prime Factors of Fermat Numbers

If 2^{n} + 1 is prime, it can be shown that *n* must be a power of 2. (If *n* = *ab* where 1 < *a*, *b* < *n* and *b* is odd, then 2^{n} + 1 ≡ (2^{a})^{b} + 1 ≡ (−1)^{b} + 1 ≡ 0 (**mod** 2^{a} + 1).) In other words, every prime of the form 2^{n} + 1 is a Fermat number, and such primes are called **Fermat primes**. The only known Fermat primes are *F*_{0},...,*F*_{4}.

## Contents

## Basic properties

The Fermat numbers satisfy the following recurrence relations

**Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle F_{n} = (F_{n-1}-1)^{2}+1}****Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle F_{n} = F_{n-1} + 2^{2^{n-1}}F_{0} \cdots F_{n-2}}****Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle F_{n} = F_{n-1}^2 - 2(F_{n-2}-1)^2}****Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle F_{n} = F_{0} \cdots F_{n-1} + 2}**

for *n* ≥ 2. Each of these relations can be proved by mathematical induction. From the last equation, we can deduce **Goldbach's theorem**: no two Fermat numbers share a common factor. To see this, suppose that 0 ≤ *i* < *j* and *F*_{i} and *F*_{j} have a common factor *a* > 1. Then *a* divides both

**Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle F_{0} \cdots F_{j-1}}**

and *F*_{j}; hence *a* divides their difference 2. Since *a* > 1, this forces *a* = 2. This is a contradiction, because each Fermat number is clearly odd. As a corollary, we obtain another proof of the infinitude of the prime numbers: for each *F*_{n}, choose a prime factor *p*_{n}; then the sequence {*p*_{n}} is an infinite sequence of distinct primes.

Here are some other basic properties of the Fermat numbers:

- If
*n*≥ 2, then*F*_{n}≡ 17 or 41 (**mod**72). (See modular arithmetic) - If
*n*≥ 2, then*F*_{n}≡ 17, 37, 57, or 97 (**mod**100). - The number of digits
*D*(*n*,*b*) of*F*_{n}expressed in the base*b*is

**Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle D(n,b) = \lfloor \log_{b}\left(2^{2^{n}}+1\right)+1 \rfloor \approx \lfloor 2^{n}\,\log_{b}2+1 \rfloor }**(See floor function)

- No Fermat number can be expressed as the sum of two primes, with the exception of F
_{1}= 2 + 3. - No Fermat prime can be expressed as the difference of two
*p*th powers, where*p*is an odd prime.

## Primality of Fermat numbers

Fermat numbers and Fermat primes were first studied by Pierre de Fermat, who conjectured that all Fermat numbers are prime. Indeed, the first five Fermat numbers *F*_{0},...,*F*_{4} are easily shown to be prime. However, this conjecture was refuted by Leonhard Euler in 1732 when he showed that

**Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle F_{5} = 2^{2^5} + 1 = 2^{32} + 1 = 4294967297 = 641 \cdot 6700417 \; }**

It is interesting to note how Euler found this factorization. Euler had proved that every factor of *F*_{n} must have the form *k*2^{n+1} + 1. For *n* = 5, this means that the only possible factors are of the form 64*k* + 1. It did not take Euler very long to find the factor 641 = 10×64 + 1.

It is widely believed that Fermat was aware of Euler's result, so it seems curious why he failed to follow through on the straightforward calculation to find the factor. One common explanation is that Fermat made a computational mistake and was so convinced of the correctness of his claim that he failed to double-check his work.

There are no other known Fermat primes *F*_{n} with *n* > 4. In fact, each of the following is an open problem:

- Is
*F*_{n}composite for all*n*> 4? - Are there infinitely many Fermat primes?
- Are there infinitely many composite Fermat numbers?

The following heuristic argument suggests there are only finitely many Fermat primes: according to the prime number theorem, the "probability" that a number *n* is prime is at most *A*/ln(*n*), where *A* is a fixed constant. Therefore, the total expected number of Fermat primes is at most

**Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle A \sum_{n=0}^{\infty} \frac{1}{\ln F_{n}} = \frac{A}{\ln 2} \sum_{n=0}^{\infty} \frac{1}{\log_{2}(2^{2^{n}}+1)} < \frac{A}{\ln 2} \sum_{n=0}^{\infty} 2^{-n} = \frac{2A}{\ln 2}}**

It should be stressed that this argument is in no way a rigorous proof. For one thing, the argument assumes that Fermat numbers behave "randomly", yet we have already seen that the factors of Fermat numbers have special properties. Although it is widely believed that there are only finitely many Fermat primes, it should be noted that there are some experts who disagree. [1]

As of this writing (2004), it is known that *F*_{n} is composite for 5 ≤ *n* ≤ 32, although complete factorisations of *F*_{n} are known only for 0 ≤ *n* ≤ 11. The largest known composite Fermat number is *F*_{2478782}, and its prime factor 3×2^{2478785} + 1 was discovered by John Cosgrave and his Proth-Gallot Group on October 10, 2003.

There are a number of conditions that are equivalent to the primality of *F*_{n}.

**Proth's theorem**-- (1878) Let*N*=*k*2^{m}+ 1 with odd*k*< 2^{m}. If there is an integer*a*such that

**Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle a^{(N-1)/2} \equiv -1 \mod N }**

- then
*N*is prime. Conversely, if the above congruence does not hold, and in addition

**Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \left(\frac{a}{N}\right)=-1}**(See Jacobi symbol)

- then
*N*is composite. If*N*=*F*_{n}> 3, then the above Jacobi symbol is always equal to −1 for*a*= 3, and this special case of Proth's theorem is known as**Pepin's test**. Although Pepin's test and Proth's theorem have been implemented on computers to prove the compositeness of many Fermat numbers, neither test gives a specific nontrivial factor. In fact, no specific prime factors are known for*n*= 14, 20, 22, and 24.

- Let
*n*≥ 3 be a positive odd integer. Then*n*is a Fermat prime if and only if for every*a*coprime to*n*,*a*is a primitive root**mod***n*if and only if*a*is a quadratic nonresidue**mod***n*. - The Fermat number
*F*_{n}> 3 is prime if and only if it can be written uniquely as a sum of two nonzero squares, namely

**Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle F_{n}=\left(2^{2^{n-1}}\right)^{2}+1^{2}}**

- For example,
*F*_{5}= 62264^{2}+ 20449^{2}and*F*_{6}= 4046803256^{2}+ 1438793759^{2}.

## Factorisation of Fermat numbers

Because of the size of Fermat numbers, it is difficult to factorize or to prove primality of those. Pepin's test is necessary and sufficient test for primality of Fermat numbers which can be implemented by modern computers. Elliptic curve method is a fast method for finding small prime divisors of numbers, and at least GIMPS is trying to find prime divisors of Fermat numbers by elliptic curve method. Distributed computing project Fermatsearch has also successfully found some factors of Fermat numbers. Yves Gallot's proth.exe has been used to find factors of large Fermat numbers. Lucas proved in year 1878 that every factor of Fermat number **Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle F_n}**
is of the form **Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle 2^{n+2}k+1}**
, where k is a positive integer.

## Fermat's little theorem and pseudoprimes

...Using Fermat numbers to generate infinitely many pseudoprimes...

## Relationship to constructible polygons

An *n*-sided regular polygon can be constructed with ruler and compass if and only if *n* is a power of 2 or the product of a power of 2 and distinct Fermat primes. In other words, if and only if *n* is of the form *n* = 2^{k}*p*_{1}*p*_{2}...*p*_{s}, where *k* is a nonnegative integer and the *p*_{i} are distinct Fermat primes. See constructible polygon.

A positive integer *n* is of the above form if and only if φ(*n*) is a power of 2, where φ(*n*) is Euler's totient function.

## Applications of Fermat numbers

...Fermat number transform...random number generation...

## Other interesting facts

...F_{n} cannot be a perfect power, perfect, or part of amicable pair, etc...

## Generalised Fermat numbers

...*brief* definition of L(p,m) and G(p,m)...

## See also

- Mersenne prime
- Lucas's theorem
- Proth's theorem
- Pseudoprime
- Primality test
- Constructible number
- Sierpinski number

**External links:**

- Sequence of Fermat numbers
- Prime Glossary Page on Fermat Numbers
- Generalized Fermat Prime search
- History of Fermat Numbers
- Unification of Mersenne and Fermat Numbers
- Prime Factors of Fermat Numbers

**References**:

*17 Lectures on Fermat Numbers: From Number Theory to Geometry*, Michal Krizek, Florian Luca, Lawrence Somer, Springer, CMS Books 9, ISBN 0387953329 (This book contains an extensive list of references.)

ang:Fermat tæl da:Fermatprimtal de:Fermat-Zahl es:Número primo de Fermat fr:Nombre de Fermat ko:페르마 수 it:Numero primo di Fermat he:מספר פרמה hu:Fermat-számok nl:Fermatgetal ja:フェルマー数 pl:Liczby Fermata pt:Número de Fermat ru:Число Ферма sl:Fermatovo praštevilo sv:Fermattal zh:費馬數