OurBigBook
About
$
Donate
Sign in
Sign up
Mersenne prime
(
2
n
−
1
)
Ciro Santilli
(
@cirosantilli,
37
)
Mathematics
Area of mathematics
Number theory
Prime number
Type of prime number
Updated
2025-07-16
0
Like
1 By others
on same topic
0 Discussions
Create my own version
Table of contents
Are there infinitely many Mersenne primes?
Mersenne prime
Lucas-Lehmer primality test
Mersenne prime
Are there infinitely many Mersenne primes?
0
0
0
Mersenne prime
Tags:
Are there infinitely many primes with property X
,
Famous conjecture
Lucas-Lehmer primality test
0
0
0
Mersenne prime
Tags:
Primality test
Ancestors
(6)
Type of prime number
Prime number
Number theory
Area of mathematics
Mathematics
Home
View article source
Discussion
(0)
Subscribe (1)
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(1)
Show body
Body
0
Mersenne prime
by
Wikipedia Bot
0
View more
A
Mersenne prime
is
a
specific
type of
prime number
that can be expressed in the form \(
M
_
n
=
2
^
n
-
1\)
, where \(
n
\) is
a
positive
integer
. In other
words
, if \(
M
_
n
\) is prime, then \(
n
\) itself must also be prime.
See all articles in the same topic
Create my own version