A 32-bit Mersenne Twister pseudorandom number generator.
-
Updated
Jan 13, 2025 - JavaScript
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.
Generate Mersenne prime numbers into files (C++)
Lists all currently known Mersenne primes written in full.
Primality test for Mersenne primes (M_{n}=2^{n}-1)
Configurable Mersenne Twister PRNG implementation written in TypeScript.
Add a description, image, and links to the mersenne topic page so that developers can more easily learn about it.
To associate your repository with the mersenne topic, visit your repo's landing page and select "manage topics."