GPU Mersenne primality test.
-
Updated
May 23, 2024 - C++
GPU Mersenne primality test.
Approach to calculating big Mersenne primes with arbitrary precision numbers.
Fixed version of the same name hackage package
A simple Lucas-Lehmer primality test implementation for C++
Collection of useful methodes and classes.
Generates two TeX-files (which then can be used to build a pdf) for a given mersenne prime number with per-page-statistics and calculates the happy number sequence.
A Mersenne prime is a prime number that is one less than a power of two. That is, it is a prime number of the form M_{n}=2^{n}-1 for some integer n.
Simple C code which searching for Mersenne prime about first 1M numbers
An exploration of the integer sequence: Mersenne Primes
Primality testing and prime factorization utility
Add a description, image, and links to the mersenne-numbers topic page so that developers can more easily learn about it.
To associate your repository with the mersenne-numbers topic, visit your repo's landing page and select "manage topics."