Generate Euler Shift 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.

Maths stuff, including cryptographic attacks implementations, and others useful algorithms

EPR: A Factoring and Primality checking library for C++

Implementation of Solovay-Strassen Test Primality with GMP

Discover prime numbers without math

An implementation of the Miller-Rabin primality test for `num_bigint::BigUint`

Implementation of the Miller-Rabin primality test.

Test if a value is a composite number.

A python script that would check the primality of positive integers.

ne plus ultra primality testing for machine-sized integers

Test if a value is a prime number.

Test if a number is prime.

Test if a number is composite.

A prime k-tuple finder based on the rug crate.