Packages
lehmer_gcd
v1.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 9 months ago
106 639recent downloadstotal downloads: 106 925 -
A fast and efficient Elixir library for prime factorization of integers.
Published 9 months ago
37recent downloadstotal downloads: 182 -
A probabilistic primality test implementation in Elixir based on Fermat's Little Theorem.
Published 9 months ago
15recent downloadstotal downloads: 87
3
packages of
3
total
