An exploration of the integer sequence: Mersenne Primes
-
Updated
Feb 9, 2023 - Jupyter Notebook
An exploration of the integer sequence: Mersenne Primes
Simply put, this program is a primality test program, it tests whether a number you input is prime or not using one of today's most modern efficient methods of primality testing: miller's test.
A very fast async parallel generator for big/large prime numbers. Several prime numbers can be generated simultaneously via the bit or digit length.
A collection of algorithms related to prime numbers
Whitman College Math Senior Project 2018
visited algorithms explanation and code
A python script that would check the primality of positive integers.
Probabilistic approach to primality testing
Primality testing algorithms using Haskell. Currently using AKS algorithm, more later.
implementation of Algorithms on Arrays
Generate Euler Shift Primes
Implementation of Solovay-Strassen Test Primality with GMP
A collection of implemented cryptography algorithms and optimizations.
2️⃣ 3️⃣ 5️⃣ 7️⃣ Prime numbers for JavaScript
Implementation of the AKS primality test in python
Functions in Python doing prime stuff.
A set of data structures and algorithms I have implemented for fun. Most of the algorithms are just tested for functionality using toy examples.
Very long integer class and some methods for it
Studying the quality of different primality tests and finding ways to reduce pseudoprimes
Add a description, image, and links to the primality-testing topic page so that developers can more easily learn about it.
To associate your repository with the primality-testing topic, visit your repo's landing page and select "manage topics."