Primality test for Mersenne primes (M_{n}=2^{n}-1)
-
Updated
Mar 22, 2021 - Rust
Primality test for Mersenne primes (M_{n}=2^{n}-1)
Prime factorization up to 128 bit integers
This is used to facilitate benchmarking Graviton2
web api to Verify Prime numbers with 64 iterations of miller rabin test.
Add a description, image, and links to the primality-test topic page so that developers can more easily learn about it.
To associate your repository with the primality-test topic, visit your repo's landing page and select "manage topics."