Arithmetic
Special Prime Numbers
The Woman Behind the Mask: How Sophie Germain Fooled the Mathematicians of Paris
**Marin Mersenne** (1588 - 1648) - a French friar who corresponded with the greatest minds of the age: Descartes, Fermat, Pascal. He studied numbers of the form 2ᵖ−1 and tried to understand which of them were prime. His notes launched a hunt that has lasted 400 years.
Mathematics is the language in which God wrote the universe. - Galileo Galilei
Sophie Germain primes today protect your bank transactions. **Safe primes** (2p+1) are used in Diffie-Hellman cryptography. And twin primes? After 2,500 years we still don't know if there are infinitely many. In 2013, Yitang Zhang made a breakthrough: he proved infinitely many prime pairs exist with a gap less than 70 million. A gap of 2 - twins - remains beyond the horizon.
Prime numbers are the atoms of arithmetic. But even among them there are "celebrities": Mersenne primes give the largest known primes, twins stubbornly appear in pairs, and Sophie Germain primes protect your internet communications. Each type has its own history and unsolved problems.
- **Cryptography:** RSA and Diffie-Hellman use special primes
- **Distributed computing:** GIMPS searches for Mersenne primes
- **Mathematics:** open problems with million-dollar prizes
Mersenne Primes
**Mersenne primes** are primes of the form 2ᵖ - 1. They are linked to perfect numbers and hold records for the largest known primes.
**Definition:** Mₚ = 2ᵖ - 1 is a Mersenne prime if: • p is prime • Mₚ is prime **Examples:** M₂ = 3, M₃ = 7, M₅ = 31, M₇ = 127
The GIMPS project unites millions of computers to search for Mersenne primes. The last 20+ records are their achievement.
Why is 2¹¹ - 1 = 2047 not a Mersenne prime?
Twin Primes
**Twin primes** are pairs of prime numbers differing by 2. This is the minimum possible gap between primes (other than 2 and 3).
**Triplets and quadruplets:** • (5, 7, 11) - no, 7 and 11 are not twins • (5, 7), (11, 13), (17, 19) - three consecutive pairs • "Cousin primes": gap 4 (e.g., 7 and 11) • "Sexy primes": gap 6 (e.g., 5 and 11)
Twins become rarer as numbers grow, but nobody has proved that they eventually stop.
Which pair consists of twin primes?
Sophie Germain Primes
A **Sophie Germain prime** is a prime p such that 2p + 1 is also prime. Named after the mathematician Sophie Germain (1776 - 1831).
**Sophie Germain (1776 - 1831):** A French mathematician who worked under the pseudonym "Monsieur LeBlanc" due to discrimination against women in science. Contributions to: • Number theory (Fermat's theorem) • Theory of elasticity • Philosophy of mathematics
Whether there are infinitely many Sophie Germain primes is unknown. Heuristics predict there are, but no proof exists.
Is 11 a Sophie Germain prime?
Prime Gaps
A **prime gap** is the distance between consecutive prime numbers. Gaps grow on average but behave chaotically.
**Gap records:** • First gap of 8: after 89 (to 97) • First gap of 20: after 887 (to 907) • First gap of 100: after 396,733 (to 396,833) • First gap of 1000: after a number with ~200 digits
Gaps can be huge, yet twins (gap 2) still appear among large numbers. This is one of the mysteries of prime numbers.
Prime numbers are distributed uniformly or follow a formula
Prime numbers are distributed chaotically but with statistical regularities
Gaps between primes range from 2 (twins) to arbitrarily large values. No formula produces all primes. But the prime number theorem predicts average density: π(n) ≈ n/ln(n). Chaos at the micro level, order at the macro level.
Why are n! + 2, n! + 3, ..., n! + n all composite?
Key Ideas
- Mersenne: 2ᵖ - 1, give the largest known primes
- Twins: gap 2, infinitude not proved
- Sophie Germain: p and 2p+1 both prime
- Gaps: grow on average like ln(p)
Related Topics
Special primes are connected to general prime number theory:
- Prime Numbers — Basic concepts
- Perfect Numbers — Connection to Mersenne primes
- Modular Arithmetic — Lucas-Lehmer test
Вопросы для размышления
- Why are the largest known primes Mersenne primes?
- How would you prove (or disprove) that there are infinitely many twin primes?
- Why are safe primes important in cryptography?