Mersenne prime search using integer arithmetic and an IDBWT via an NTT executed on the GPU through OpenCL.
-
Updated
Oct 6, 2026 - C++
Mersenne prime search using integer arithmetic and an IDBWT via an NTT executed on the GPU through OpenCL.
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
This repository holds a makefile useful for installing a Mersenne prime gpu computing machine.
Create an array containing pseudorandom numbers generated using a 32-bit Mersenne Twister pseudorandom number generator.
Generate Mersenne prime numbers into files (C++)
Lists all currently known Mersenne primes written in full.
Collatz Dynamics: Structural Description of the Collatz Inverse Tree via Mersenne-Fermat Factorization and Jacobsthal Sequences
Configurable Mersenne Twister PRNG implementation written in TypeScript.
A Mersenne Primality Test that implements the Lucas-Lehmer Test
Primality test for Mersenne primes (M_{n}=2^{n}-1)
To associate your repository with the mersenne topic, visit your repo's landing page and select "manage topics."