This is due to the Lucas-Lehmer primality exercice, which is an efficace 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 an infinite number of them. Another notabilité pr