Approach to calculating big Mersenne primes with arbitrary precision numbers.
-
Updated
Dec 13, 2017 - Python
#
mersenne-numbers
Here are 2 public repositories matching this topic...
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.
python python-script python3 prime-numbers mersenne-numbers recreational-mathematics mersenne-prime-number
-
Updated
May 22, 2022 - Python
Improve this page
Add a description, image, and links to the mersenne-numbers topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the mersenne-numbers topic, visit your repo's landing page and select "manage topics."