A 32-bit Mersenne Twister pseudorandom number generator.

A prime k-tuple finder based on the rug crate.

Approach to calculating big Mersenne primes with arbitrary precision numbers.

(WIP) Esoteric Mathematic Library for TypeScript

Create an array containing pseudorandom numbers generated using a 32-bit Mersenne Twister pseudorandom number generator.

This repository holds a makefile useful for installing a Mersenne prime gpu computing machine.

Lists all currently known Mersenne primes written in full.

Generate Mersenne prime numbers into files (C++)

mersenne.click source code.

Fetching PrimeNet's daily results of the GIMPS project ..

Primality test for Mersenne primes (M_{n}=2^{n}-1)

Configurable Mersenne Twister PRNG implementation written in TypeScript.

Fetching PrimeNet's daily results of the GIMPS project ..

Mersenne数の素因数リスト