Packages
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.
Current section
1 Dependant
Jump to
Current section
1 Dependant
Packages depending on binary_gcd
1 package-
An efficient implementation of the Lehmer GCD algorithm for computing the greatest common divisor of large integers in Elixir.
Updated 6 days ago
101recent downloadstotal downloads: 376
1
package of
1
total
Checksum
Dependency Config
mix.exs
rebar.config
Gleam
erlang.mk
Package Details
Downloads
Last 30 days,
all versions
this version
177
yesterday
0
last 7 days
6
all time
2 043