Posted on by Kalkicode
Code Number

Mersenne Prime Number

A Mersenne prime number is a prime number that can be written in the form 2^p-1, where p is also a prime number. These primes are named after Marin Mersenne, a French monk who studied them extensively in the 17th century.

Mersenne primes have been of great interest to mathematicians for centuries due to their rare occurrence and their connection to many areas of mathematics, including number theory and cryptography. As of 2021, only 51 Mersenne primes are known, the largest of which has over 24 million digits!

One of the reasons why Mersenne primes are so interesting is that they are closely related to perfect numbers. A perfect number is a positive integer that is equal to the sum of its proper divisors (i.e., all of its divisors except itself). It turns out that every even perfect number can be expressed as 2^(p-1)(2^p-1), where 2^p-1 is a Mersenne prime. However, it is still an open question whether there are any odd perfect numbers.

The discovery of new Mersenne primes is still an active area of research in number theory, and there are ongoing efforts to find even larger examples. These efforts are often carried out using distributed computing projects, such as the Great Internet Mersenne Prime Search (GIMPS), which harness the computing power of thousands of volunteers around the world to search for new Mersenne primes.

There are following program which are provide the solution of this problem.


Please share your knowledge to improve code and content standard. Also submit your doubts, and test case. We improve by your feedback. We will try to resolve your query as soon as possible.

New Comment