Fermat numbers are named after the mathematician Pierre de Fermat. They are defined by Fₙ = 2^(2ⁿ) + 1, where n is a non-negative integer. The first few Fermat numbers are 3, 5, 17, 257, and 65537. These first five numbers are all prime and are known as Fermat primes. Fermat conjectured that every Fermat number is prime, but this conjecture was disproved when Euler showed that the next Fermat number, F₅ = 2³² + 1, is composite. Fermat numbers have an important property: any two distinct Fermat numbers are relatively prime. Fermat primes are also connected to the construction of regular polygons using a compass and straightedge.
Fermat Numbers and Fermat Primes
Fermat numbers are integers of the form 2^(2^n) + 1. When such a number is prime, it is called a Fermat prime.
Fₙ = 2^(2ⁿ) + 1
Explanation
Variables
Fₙ
The nth Fermat number.
N
A non-negative integer.
2ⁿ
The exponent applied to the base 2.
Example or application
A worked example has not yet been added.
Definition
A Fermat number is an integer of the form 2^(2ⁿ) + 1. A Fermat prime is a Fermat number that is prime.
Purpose
To study a special family of integers, their factorization properties, and their connections to classical geometry.
Importance
Fermat numbers are important in number theory, the study of prime numbers, integer factorization, and constructible regular polygons.
Key Concepts
Fermat numbers
Fermat primes
Double exponentiation
Prime factorization
Pairwise coprimality
Compass-and-straightedge construction
Characteristics
Fermat numbers have the form 2^(2ⁿ) + 1.
The exponent of 2 is itself a power of 2.
The first five Fermat numbers are prime.
Not every Fermat number is prime.
Distinct Fermat numbers are pairwise relatively prime.
Fermat primes are connected to constructible regular polygons.
Types
| Name | Description |
|---|---|
Fermat number | Any integer generated by the Fermat-number formula. |
Fermat prime | A Fermat number that is prime. |
Composite Fermat number | A Fermat number that is not prime. |
Components
Base 2
Power-of-two exponent
Exponentiation
Addition of 1
Primality and factorization
Properties
F₀ = 3, F₁ = 5, F₂ = 17, F₃ = 257, and F₄ = 65537.
The first five Fermat numbers are prime.
F₅ = 2³² + 1 is composite.
Any two distinct Fermat numbers have greatest common divisor 1.
Every prime factor of a Fermat number Fₙ has a special form: it is congruent to 1 modulo 2^(n+1), for n ≥ 1.
A regular polygon with an odd number of sides can be constructed using a compass and straightedge precisely when its number of sides is a product of distinct Fermat primes.
Examples
| Problem | Solution |
|---|---|
Calculate F₀. | F₀ = 2^(2⁰) + 1 = 2¹ + 1 = 3. Therefore, F₀ is prime. |
Calculate F₂. | F₂ = 2^(2²) + 1 = 2⁴ + 1 = 17. Therefore, F₂ is prime. |
Is F₅ prime? | F₅ = 2³² + 1 = 4294967297. It is composite because 4294967297 = 641 × 6700417. |
Applications
Number theory research
Integer factorization
Classical geometric construction
Study of special prime families
Mathematical proof and conjecture analysis
Prerequisites
Prime numbers
Exponents
Powers of 2
Factorization
Greatest common divisor
Learning Objectives
Define Fermat numbers.
Calculate the first few Fermat numbers.
Distinguish Fermat numbers from Fermat primes.
Understand why Fermat's original conjecture was incorrect.
Explain the pairwise coprimality property.
Recognize the connection between Fermat primes and constructible polygons.
Common Mistakes
Confusing 2^(2ⁿ) with 2ⁿ.
Assuming every Fermat number is prime.
Forgetting that n begins at 0.
Confusing a Fermat number with a Mersenne number.
Assuming the first five prime examples prove that all Fermat numbers are prime.
Practice Questions
Calculate F₀, F₁, and F₂.
What is the general formula for a Fermat number?
What is a Fermat prime?
Why is F₅ important in the history of Fermat numbers?
What does pairwise coprimality mean?
How are Fermat primes connected to regular polygon construction?
Key Takeaway
Fermat numbers follow the form 2^(2ⁿ) + 1, but only some are prime; their properties connect number theory with classical geometry.
Related Topics
Prime Numbers
Mersenne Primes
Greatest Common Divisor
Integer Factorization
Constructible Polygons
Sources and verification
Sources are shown as provided in the project data. Not every source has yet been independently verified. Please report errors or missing citations.
- Source verification pending; check an authoritative textbook, university, standards body, or peer-reviewed source.
Suggest a correction or source · More in Arithmetic & Number Theory