Packages
An efficient implementation of the Lehmer GCD algorithm for computing the greatest common divisor of large integers in Elixir.
Current section
3 Dependencies
Jump to
Current section
3 Dependencies
Dependencies of lehmer_gcd
3 dependencies| Package | Requirement |
|---|---|
| binary_gcd |
~> 1.1
|
| bit_length |
~> 1.0
|
| nstandard |
~> 0.1
|
