Here are
11 public repositories
matching this topic...
Mersenne prime search using integer arithmetic and an IDBWT via an NTT executed on the GPU through OpenCL.
GPU Mersenne primality test.
Primality test for Mersenne primes (M_{n}=2^{n}-1)
Updated
Mar 22, 2021
Rust
A program made to search for Mersenne primes
Updated
Oct 14, 2020
Python
Software to perform the LLR test with GNU MP, proving the primality of Riesel numbers of the form h*2^n-1
An optimized Lucas-Lehmer primality test
Verified primes of the form h*2^n-1 where h < 2^n
Primality testing and prime factorization utility
Updated
Dec 21, 2017
Haskell
A simple Lucas-Lehmer primality test implementation for C++
Software to perform the LLR test, proving the primality of Riesel numbers of the form h*2^n-1.
A Javascript Implementation of the Lucas-Lehmer Primality Test for Mersenne Primes
Updated
Apr 2, 2017
JavaScript
Improve this page
Add a description, image, and links to the
lucas-lehmer
topic page so that developers can more easily learn about it.
Curate this topic
Add this topic to your repo
To associate your repository with the
lucas-lehmer
topic, visit your repo's landing page and select "manage topics."
Learn more
You can’t perform that action at this time.