Packages
lehmer_gcd
v 1.0.2
An efficient implementation of the Lehmer GCD algorithm for computing the greatest common divisor of large integers in Elixir.
Packages depending on lehmer_gcd
3 packages-
A pure Elixir implementation of the AKS (Agrawal-Kayal-Saxena) primality test algorithm.
Published 8 months ago
76 227recent downloadstotal downloads: 76 423 -
A fast and efficient Elixir library for prime factorization of integers.
Published 8 months ago
53recent downloadstotal downloads: 172 -
A probabilistic primality test implementation in Elixir based on Fermat's Little Theorem.
Published 8 months ago
26recent downloadstotal downloads: 80
3
packages of
3
total
