What are Mersenne Primes?
![](https://static.wixstatic.com/media/824cee_390deccefbc7448b98a53e5db408a8f0~mv2.jpg/v1/fill/w_225,h_225,al_c,q_80,enc_auto/824cee_390deccefbc7448b98a53e5db408a8f0~mv2.jpg)
Discovered by and named after Marin Mersenne, Mersenne primes are prime numbers which are one less than a power of two. They were first studied by Mersenne in the 17th century.
In mathematical terms Mersenne primes may be denoted as primes of the form 2n - 1.
To further study Mersenne primes, look at this pattern-
21 - 1 = 1
22 - 1 = 3
![](https://static.wixstatic.com/media/824cee_4ff0355422494a3796efebd6eae74704~mv2.gif/v1/fill/w_430,h_303,al_c,pstr/824cee_4ff0355422494a3796efebd6eae74704~mv2.gif)
23 - 1 = 7
24 - 1 = 15
25 - 1 = 31
26 - 1 = 63
27 - 1 = 127
What do you observe? To the untrained eye, it may seem that all the numbers which are one less than a prime power of two are Mersenne primes.
Most people are quick to assume this fact but it is not true. Take the example of n = 11:
211 - 1 = 2047
While 2047 may look like a prime number, it actually isn’t one because it is divisible by 23.
From this we can conclude that if 2n - 1 is a Mersenne prime, then n is necessarily prime, but if n is a prime number, then 2n - 1 is not necessarily a Mersenne prime.
Comments