- published: 12 Jan 2012
- views: 73194
In mathematics, a Fermat number, named after Pierre de Fermat who first studied them, is a positive integer of the form
where n is a nonnegative integer. The first few Fermat numbers are:
If 2k + 1 is prime, and k > 0, it can be shown that k must be a power of two. (If k = ab where 1 ≤ a, b ≤ k and b is odd, then 2k + 1 = (2a)b + 1 ≡ (−1)b + 1 = 0 (mod 2a + 1). See below for a complete proof.) In other words, every prime of the form 2k + 1 (other than 2 = 20 + 1) is a Fermat number, and such primes are called Fermat primes. As of 2015, the only known Fermat primes are F0, F1, F2, F3, and F4(sequence A019434 in OEIS).
The Fermat numbers satisfy the following recurrence relations:
for n ≥ 1,
for n ≥ 2. Each of these relations can be proved by mathematical induction. From the last equation, we can deduce Goldbach's theorem (named after Christian Goldbach): no two Fermat numbers share a common integer factor greater than 1. To see this, suppose that 0 ≤ i < j and Fi and Fj have a common factor a > 1. Then a divides both