Current section
2 Dependants
Jump to
Current section
2 Dependants
Packages depending on bit_length
2 packages-
An efficient implementation of the Lehmer GCD algorithm for computing the greatest common divisor of large integers in Elixir.
Updated 10 months ago
70recent downloads -
A high-performance implementation of the greatest common divisor (GCD) algorithm that combines binary GCD with Lehmer's algorithm for optimal performance on large integers.
Updated 10 months ago
23recent downloads
2
packages of
2
total
