References in periodicals archive

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

An Ultra-light PRNG Passing Strict Randomness Tests and Suitable for Low Cost Tags

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.

Intel Skylake chips cause system freeze at high workloads

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.

A Monte Carlo simulation framework for testing cosmological models

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.

On recognition of simple group [L.sub.2](r) by the number of sylow subgroups/Sobre o reconhecimento do grupo simples [L.sub.2](r) pelo numero dos sub-grupos de Sylow

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

Odd and long; Computers aid a `prime' obsession

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.

World's largest prime number discovered with 17 million digits

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].

A simple proof of the Sophie Germain primes problem along with the Mersenne primes problem and their connection to the Fermat's last conjecture

[M.sup.l.sub.p] is a loose Mersenne prime, which is any integral prime divisor of a Mersenne composite.

Application of new classes of Mersenne primes for fast modular reduction for large-integer multiplication

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.

Volunteer computing model prospects in performance data gathering for broadband policy formulation

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].

An elementary proof of the Mersenne primes conjecture and the connection with the Goldbach conjecture

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).

Numbers