So that you don't have to go through the process of verifying it for yourself, an online collaboration called Great Internet

Mersenne Prime Search (GIMPS) - whose software Pace was running - already did that.

A

Mersenne prime is used as the period of the algorithm for fast generation of pseudo random numbers, free from long-term correlations.

12 -- Mathematicians at the Great Internet

Mersenne Prime Search (GIMPS) came across the bug while running Prime95 - an application used to calculate prime numbers - in their search to find

Mersenne Prime numbers.

To generate the declination and right ascension angles of a galaxy, we used the Mersenne Twister algorithm [5], which is a pseudo-random number generator based on the

Mersenne prime [2.sup.19937] - 1.

Let G be a finite centerless group such that [n.sub.p] (G) = [n.sub.p] ([L.sub.2] (r)) for every prime p [member of] [pi](G) = [pi]([L.sub.2](r)), where r is prime but not

Mersenne prime and [r.sup.2] does not divide order of G.

It's a

Mersenne prime, in which the exponent of 2 (57,885,161 in this case) is also a prime number.

This latest giant prime number was found as part of the Great Internet

Mersenne Prime Search (GIMPS), a network that harnesses the spare power of 360,000 computers around the world to look for and calculate prime numbers.

M(n) = {x;1 < x < 2n and x is a Mersenne prime}, observing by using Abstract and definitions that [M.sub.13] is a

Mersenne prime, then it becomes immediate to deduce that for every integer n [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] and [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] and x is a Sophie Germain prime}, observing that 233 is a Sophie Germain prime (see Abstract and definitions), then it becomes immediate to deduce that for every integer n [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII].

[M.sup.l.sub.p] is a loose

Mersenne prime, which is any integral prime divisor of a Mersenne composite.

One of the first projects to benefit from the volunteer computing is 'Great Internet

Mersenne Prime Search', (GIMPS) (8), a mathematics project on finding the prime numbers.

M(n) = {x; 1 < x < 2n and x is a Mersenne prime} (observing that [M.sub.13] is a

Mersenne prime, then it becomes immediate to deduce that for every integer n [greater than or equal to] 4096, [M.sub.13] [member of] M(n)); [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII].

Primequest The Great Internet

Mersenne Prime Search, a cooperative computing project, helps find a prime with nearly 13 million digits (SN Online: 9/20/08).