|
In mathematics, a double Mersenne number is a Mersenne number of the form Euclid, Greek mathematician, 3rd century BC, as imagined by by Raphael in this detail from The School of Athens. ...
In mathematics, a Mersenne number is a number that is one less than a power of two. ...
 where n is a positive integer. In mathematics, a natural number can mean either an element of the set {1, 2, 3, ...} (i. ...
The smallest double Mersenne numbers
The sequence of double Mersenne numbers (sequence A077585 in OEIS) begins The On-Line Encyclopedia of Integer Sequences (OEIS) is an extensive searchable database of integer sequences, freely available on the Web. ...
       Double Mersenne primes A double Mersenne number that is prime is called a double Mersenne prime. Since a Mersenne number Mn can be prime only if n is prime, (see Mersenne prime for a proof of this), a double Mersenne number can be prime only if Mn is itself a Mersenne prime. The first values of n for which Mn is prime are n = 2, 3, 5, 7, 13, 17, 19, 31. Of these, is known to be prime for n = 2, 3, 5, 7; for n = 13, 17, 19, and 31, explicit factors have been found showing that the corresponding double Mersenne numbers are not prime. If another double Mersenne prime is ever found, it would almost certainly be the largest known prime number. However, the smallest candidate is , or 22305843009213693951-1. At approximately 7 x 1017 decimal digits, this number is far, far too big for any currently known test of primality. In mathematics, a prime number (or a prime) is a natural number that has exactly two (distinct) natural number divisors, which are 1 and the prime number itself. ...
In mathematics, a Mersenne number is a number that is one less than a power of two. ...
See also In mathematics, a Mersenne number is a number that is one less than a power of two. ...
In mathematics, a perfect number is defined as an integer which is the sum of its proper positive divisors, that is, the sum of the positive divisors not including the number. ...
External links |