This is due to the Lucas-Lehmer primality épreuve, which is an efficient algorithm that is specific to testing primes of the form (2^p-1). Although Mersenne primes incessant to Sinon discovered, it is an open problem whether or not there are an infinite number of them. Another personnalité property of Mersenne primes is that they are related to t