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.
-
Updated
May 22, 2022 - Python
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.
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.
Generate Mersenne prime numbers into files (C++)
Add a description, image, and links to the mersenne-prime-number topic page so that developers can more easily learn about it.
To associate your repository with the mersenne-prime-number topic, visit your repo's landing page and select "manage topics."