Math 2.0

definition

Mersenne prime

Definition

A Mersenne prime is a prime number of the form 2n−12^n - 1 for a natural number nn. That is, a Mersenne prime is a Mersenne number that is prime.

Remarks

The first Mersenne primes are 33, 77, 3131 and 127127, for n=2,3,5,7n = 2, 3, 5, 7. If 2n−12^n - 1 is prime, then nn is prime. The converse fails: 211−1=2047=23⋅892^{11} - 1 = 2047 = 23 \cdot 89. The Lucas–Lehmer test decides whether 2p−12^p - 1 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 22, such as 31=25−131 = 2^5 - 1. 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.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Divisibility definition
  2. Mersenne number definition
  3. Prime number definition
  4. Mersenne prime definition

What depends on this

1 node uses this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Mersenne_prime, About Mersenne primes