Mersenne prime
Definition
A Mersenne prime is a prime number of the form for a natural number . That is, a Mersenne prime is a Mersenne number that is prime.
Remarks
The first Mersenne primes are , , and , for . If is prime, then is prime. The converse fails: . The Lucas–Lehmer test decides whether is prime. It is not known whether there are infinitely many Mersenne primes.
Explanations
L1 human
A Mersenne prime is a prime that is one less than a power of , such as . The even perfect numbers come exactly from these primes, by the Euclid–Euler theorem.
What this node needs for W2
- edge instance_of in: one example (0 of 1)
- edge not_instance_of in: one non-example that fails one clause (0 of 1)
The writing levels say how complete the text of a node is. They do not measure its truth.
What this needs
To read this node, read these 4 nodes in this order. The foundations come first, and the list ends with this node.
- no evidence level
- Divisibility definition
- Mersenne number definition
- Prime number definition
- Mersenne prime definition
What depends on this
1 node uses this node, directly or through other nodes.
- Euclid–Euler theorem 0WETJCKNRG
Sources
- Web https://en.wikipedia.org/wiki/Mersenne_prime, About Mersenne primes
What links here
Used by
- Euclid–Euler theorem 0WETJCKNRG