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