https://github.com/natrimmer/mersenne-primes

An exploration of the integer sequence: Mersenne Primes
https://github.com/natrimmer/mersenne-primes

jupyter-notebook mersenne-numbers number-theory primality-testing

Last synced: 1 day ago
JSON representation

An exploration of the integer sequence: Mersenne Primes

• Host: GitHub
• URL: https://github.com/natrimmer/mersenne-primes
• Owner: natrimmer
• Created: 2023-02-09T10:28:59.000Z (over 3 years ago)
• Default Branch: main
• Last Pushed: 2023-02-09T15:46:25.000Z (over 3 years ago)
• Last Synced: 2024-07-25T01:33:22.144Z (almost 2 years ago)
• Topics: jupyter-notebook, mersenne-numbers, number-theory, primality-testing
• Language: Jupyter Notebook
• Homepage:
• Size: 1.98 MB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

          
# Mersenne Primes

The following notebooks aim to explore a fascinating integer series called the Mersenne Primes. It's a function whose domain and range are all prime numbers. It can be written as:

f(x) = 2x - 1

When x is a prime number and f(x) is also prime, this is considered a Mersenne Prime. 

To date, there are only 51 identified Mersenne Primes. The most recently discovered was on December 07, 2018. It is 282589933 - 1. The value of that Mersenne Prime expression contains 24,862,048 digits.

The notebooks contained herein have CSV writers for primes and Mersenne Primes and a verification tool. The are also some example prime range files in output/ranges/.

# To learn more:

https://www.mersenne.org/