This is due to the Lucas-Lehmer primality examen, which is an agissant algorithm that is specific to testing primes of the form (2^p-1). Although Mersenne primes incessant to Quand discovered, it is an open problem whether or not there are an infinite number of them. Another notable property of Mers