Fermat Number
Numbers of a special exponential form.
Live Calculator
MembersVariables
Example
F_0..F_4 are prime
How it works
A Fermat number is built by taking 2 to a power that is itself a power of 2, then adding 1: F_n = 2^{2^n} + 1. This creates a very rapidly growing sequence: each step doubles the exponent, so the numbers explode in size even for small n. They matter in number theory because Fermat numbers have special algebraic properties, including the fact that any two different Fermat numbers are relatively prime, which comes from the identity that the product of earlier Fermat numbers is one less than the next power of 2. This structure also explains why they were historically studied in connection with constructible polygons and prime numbers.
When to use it
Use this formula when you need the n-th Fermat number itself, especially in problems about divisibility, primality, or pairwise coprimality. It also comes up in algebraic number theory and classical geometry questions involving constructible polygons.
Worked example, step by step
Find F_3. Step 1: Substitute n = 3 into the formula. F_3 = 2^{2^3} + 1 Step 2: Evaluate the inner exponent. 2^3 = 8 So F_3 = 2^8 + 1 Step 3: Compute the power of 2. 2^8 = 256 Step 4: Add 1. F_3 = 256 + 1 = 257
Common mistakes to avoid
- Confusing 2^{2^n} with (2^2)^n; the exponent is a tower, not a product of exponents
- Forgetting the +1 at the end, which changes the value completely
- Evaluating powers in the wrong order and computing 2^{2^n} as 2^{2}^n instead of 2^{(2^n)}
Did You Know?
Fermat guessed all his numbers were prime, but Euler shattered the claim by factoring the fifth one.
Share this formula
More in Number Theory
View allEuclidean Algorithm
BasicRecursively finds the greatest common divisor.
Modular Congruence
Basica and b have the same remainder when divided by m.
Fermat's Little Theorem
AdvancedHolds when p is prime and gcd(a,p)=1.
Euler's Totient
AdvancedCounts integers up to n coprime to n.
Prime Number Theorem
AdvancedApproximates the number of primes below x.
LCM from GCD
BasicLeast common multiple via the greatest common divisor.