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.
Published 9 months ago
115 966recent downloadstotal downloads: 116 281 -
A fast and efficient Elixir library for prime factorization of integers.
Published 9 months ago
39recent downloadstotal downloads: 193 -
A probabilistic primality test implementation in Elixir based on Fermat's Little Theorem.
Published 9 months ago
21recent downloadstotal downloads: 95
3
packages of
3
total
