Packages
An efficient implementation of the Lehmer GCD algorithm for computing the greatest common divisor of large integers in Elixir.
Current section
3 Dependants
Jump to
Current section
3 Dependants
Packages depending on lehmer_gcd
3 packages-
A pure Elixir implementation of the AKS (Agrawal-Kayal-Saxena) primality test algorithm.
Updated 11 months ago
24 079recent downloads -
A fast and efficient Elixir library for prime factorization of integers.
Updated 11 months ago
38recent downloads -
A probabilistic primality test implementation in Elixir based on Fermat's Little Theorem.
Updated 11 months ago
24recent downloads
3
packages of
3
total
