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

Comparing efficiency of prime number algorithms, including the Sieve of Eratosthenes and Trial Division, with different optimization techniques such as multiprocessing and GPU computing (CUDA).

A Practical Study and Comparison of Integer Factorization Methods

RSA Factoring Challenge

A command line utility to calculate the divisors of an integral.

Minimal elements for the base b representations of the prime numbers > b for the subsequence ordering, for 2 ≤ b ≤ 36

Check if a given number is prime using trial division

A slow C++17 library for rational numbers

Algorithms to find prime numbers

Trial division, Fermat, Miller-Rabin, Solovay–Strassen and Lucas primality tests