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).
-
Updated
Nov 22, 2024 - Python
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).
EPR: A Factoring and Primality checking library for C++
A Practical Study and Comparison of Integer Factorization Methods
RSA Factoring Challenge
A command line utility to calculate the divisors of an integral.
The minimal elements of the prime numbers which are > b written in the positional numeral system with radix b, as digit strings under the subsequence ordering, for 2 ≤ b ≤ 36
A slow C++17 library for rational numbers
Algorithms to find prime numbers
Check if a given number is prime using trial division
Trial division, Fermat, Miller-Rabin, Solovay–Strassen and Lucas primality tests
Add a description, image, and links to the trial-division topic page so that developers can more easily learn about it.
To associate your repository with the trial-division topic, visit your repo's landing page and select "manage topics."