lehmer_gcd
An efficient implementation of the Lehmer GCD algorithm for computing the greatest common divisor of large integers in Elixir.
View on Github
Activity
- Latest release
- 2mo ago
- Total releases
- 4
- Cadence
- ~daily
- Last 12 months
- 1
Reach
- Stars
- 1
Details
- License
- Apache-2.0
- First release
- Jul 20, 2025
Releases
| Version | Released | |
|---|---|---|
1.0.3
patch
| ||
1.0.2
patch
| ||
1.0.1
patch
| ||
1.0.0
initial
|