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