Mersenne

Some articles on mersenne:

Mersenne Conjectures
... In mathematics, the Mersenne conjectures concern the characterization of prime numbers of a form called Mersenne primes, meaning prime numbers that are a power of two minus one ...
Curtis Cooper (mathematician)
... the GIMPS project, Cooper and Steven Boone found the 43rd known Mersenne prime on their 700 PC cluster on December 15, 2005 ... The prime, 230402457 − 1, is 9,152,052 digits long and is the ninth Mersenne prime for GIMPS ... primes when they also found the 44th known Mersenne prime, 232582657 − 1, which has 9,808,358 digits (or M32582657 for short) ...
Double Mersenne Number
... In mathematics, a double Mersenne number is a Mersenne number of the form where p is a Mersenne prime exponent ...
Mersenne Conjectures - Original Mersenne Conjecture
... The original, called Mersenne's conjecture, was a statement by Marin Mersenne in his Cogitata Physica-Mathematica (1644 see e.g ... Due to the size of these numbers, Mersenne did not and could not test all of them, nor could his peers in the 17th century ... such as the Lucas–Lehmer test, that Mersenne's conjecture contained five errors, namely two are composite (n = 67, 257) and three omitted primes (n = 61, 89 ...
Mersenne Conjectures - Lenstra–Pomerance–Wagstaff Conjecture
... have conjectured that there is an infinite number of Mersenne primes, and, more precisely, that the number of Mersenne primes less than x is asymptotically approximated by ... In other words, the number of Mersenne primes with exponent p less than y is asymptotically This means that there should on average be about ≈ 5.92 primes p of a given number of decimal digits such that is ...