Packages
binary_gcd
v 1.1.0
An efficient Elixir implementation of the binary GCD algorithm (Stein's algorithm) for computing the greatest common divisor (GCD) of two or more non-negative integers using only bitwise operations and subtraction.
Packages depending on binary_gcd
2 packages-
An efficient implementation of the Lehmer GCD algorithm for computing the greatest common divisor of large integers in Elixir.
Published 8 months ago
80recent downloadstotal downloads: 264 -
A fast and efficient Elixir library for prime factorization of integers.
Published 8 months ago
53recent downloadstotal downloads: 172
2
packages of
2
total
