PlanetMath (more info)
 Math for the people, by the people. Sponsor PlanetMath
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Viewing Version 4 of 'Mersenne numbers'
[ view 'Mersenne numbers' | back to history ]

Title of object: Mersenne numbers
Canonical Name: MersenneNumbers
Type: Definition

Created on: 2001-10-18 09:10:39-04
Modified on: 2002-03-02 12:58:18-05

Creator: KimJ
Modifier: KimJ
Author: KimJ

Keywords: number theory
Synonyms: Mersenne numbers=Mersenne prime

Preamble:

\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{amsfonts}
\usepackage{graphicx}
\usepackage{xypic}
Content:

Numbers of the form
M_n = 2^n - 1, (n \geq 1)
are called Mersenne numbers after Father Marin Mersenne, a French monk who wanted to discover which such numbers are actually prime. Mersenne primes have a strong connection with perfect numbers.
The currently known Mersenne primes are $n$ = 2, 3, 5, 7, 13, 17, 19, 31, 61, 89, 107, 127, 521, 607, 1279, 2203, 2281, 3217, 4253, 4423, 9689, 9941, 11213, 19937, 21701, 23209, 44497, 86243, 110503, 132049, 216091, 756839, 859433, 1257787, 1398269, 2976221, 3021377, 6972593, and 13,466,917.
It is conjectured that the density of Mersenne primes with exponent $p<x$ is of order
$$ \frac{e^{\gamma}}{\log 2} \log \log x $$
where $\gamma$ is Euler's constant.