A Mersenne number is a number of the form Mₚ = 2ᵖ - 1, where p is a positive integer. If a Mersenne number is itself prime, it is called a Mersenne prime. For example, when p = 3, M₃ = 2³ - 1 = 7, which is prime. A necessary condition for a Mersenne number to be prime is that its exponent p must be prime. However, a prime exponent does not guarantee that the resulting Mersenne number is prime. For example, M₁₁ = 2047 = 23 × 89, so it is composite. The Lucas-Lehmer test is an efficient method for testing whether certain Mersenne numbers are prime. Mersenne primes are closely connected to even perfect numbers.
Mersenne Primes
Mersenne primes are prime numbers that can be expressed in the form 2^p - 1, where p is a prime exponent.
Mₚ = 2ᵖ - 1
Explanation
Variables
Mₚ
The Mersenne number associated with exponent p.
2
The fixed base.
P
A positive integer exponent; it must be prime if Mₚ is prime.
Example or application
A worked example has not yet been added.
Definition
A Mersenne prime is a prime number of the form 2ᵖ - 1, where p is prime.
Purpose
To study a special family of prime numbers with useful algebraic properties and connections to perfect numbers.
Importance
Mersenne primes are important in computational number theory, prime-search research, and the study of perfect numbers.
Key Concepts
Mersenne numbers
Prime exponents
Mersenne primes
Lucas-Lehmer test
Binary representation
Even perfect numbers
Characteristics
A Mersenne number has the form 2ᵖ - 1.
A Mersenne prime must have a prime exponent.
Not every prime exponent produces a Mersenne prime.
Every Mersenne prime is odd.
Mersenne primes have a close relationship with even perfect numbers.
Very large Mersenne primes can contain millions of digits.
Types
| Name | Description |
|---|---|
Mersenne number | Any number of the form 2ᵖ - 1. |
Mersenne prime | A Mersenne number that is also prime. |
Composite Mersenne number | A Mersenne number that has more than two positive divisors. |
Components
Base 2
Prime exponent p
Exponentiation
Subtraction of 1
Primality test
Properties
If p is composite, then 2ᵖ - 1 is composite.
If p is prime, 2ᵖ - 1 may still be composite.
Every Mersenne prime is odd.
For prime p, the number 2ᵖ - 1 has a special divisibility relationship with factors of the exponent.
Every Mersenne prime generates an even perfect number through the Euclid-Euler theorem.
Examples
| Problem | Solution |
|---|---|
Calculate M₃. | M₃ = 2³ - 1 = 8 - 1 = 7. Since 7 is prime, it is a Mersenne prime. |
Calculate M₅. | M₅ = 2⁵ - 1 = 32 - 1 = 31. Since 31 is prime, it is a Mersenne prime. |
Is M₁₁ a Mersenne prime? | M₁₁ = 2¹¹ - 1 = 2047 = 23 × 89. Therefore, it is composite. |
Applications
Large-prime discovery
Computational number theory
Perfect-number research
Primality-testing algorithms
Distributed mathematical computing
Prerequisites
Prime numbers
Exponents
Factorization
Divisibility
Modular arithmetic
Learning Objectives
Define a Mersenne number.
Recognize the form of a Mersenne prime.
Calculate small Mersenne numbers.
Explain why a Mersenne prime must have a prime exponent.
Understand why a prime exponent is not sufficient.
Describe the Lucas-Lehmer test at a conceptual level.
Recognize the connection between Mersenne primes and perfect numbers.
Common Mistakes
Assuming every Mersenne number is prime.
Assuming every prime exponent produces a Mersenne prime.
Forgetting to subtract 1 after exponentiation.
Confusing Mersenne numbers with Mersenne primes.
Treating the exponent as a number that can be composite.
Practice Questions
Calculate M₂, M₃, and M₅.
Why must the exponent of a Mersenne prime be prime?
Is 2⁷ - 1 a Mersenne prime?
Show that 2¹¹ - 1 is composite.
What is the Lucas-Lehmer test used for?
How are Mersenne primes connected to even perfect numbers?
Key Takeaway
Mersenne primes have the special form 2ᵖ - 1, and their study connects prime numbers, computational tests, and perfect numbers.
Related Topics
Prime Numbers
Perfect Numbers
Lucas-Lehmer Test
Fermat Numbers
Exponentiation
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