Mersenne prime search using integer arithmetic and an IDBWT via an NTT executed on the GPU through OpenCL.
-
Updated
Jan 22, 2026 - C++
Mersenne prime search using integer arithmetic and an IDBWT via an NTT executed on the GPU through OpenCL.
Generating and verifying arbitrarily large Mersenne primes.
A program made to search for Mersenne primes
Approach to calculating big Mersenne primes with arbitrary precision numbers.
Client C to search Mersenne primes.
prime place for scripts of primes
University project mainly involving Mersenne numbers.
Lists all currently known Mersenne primes written in full.
Calculates Mersenne primes, numbers of the form 2^n-1, where n is an integer which for certain values will produce prime numbers. This code is designed to calculate the largest known prime number as well as any other Mersenne prime.
GIMPS Search Engine (GSE), set of algorithms to find the largest prime number to date.
Generate Mersenne prime numbers into files (C++)
A mathematical paper on the work of GIMPS and how large primes are discovered
A Mersenne Primality Test that implements the Lucas-Lehmer Test
Primality test for Mersenne primes (M_{n}=2^{n}-1)
Mersenne Prime
Computing Mersenne Primes using Java and BigInteger
Pinta los pixeles primos en imagen, leer el comentario principal del código fuente para saber como hacerlo funcionar
Add a description, image, and links to the mersenne-prime topic page so that developers can more easily learn about it.
To associate your repository with the mersenne-prime topic, visit your repo's landing page and select "manage topics."