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