lehmer_gcd | Hex

lehmer_gcd 1.0.1

An efficient implementation of the Lehmer GCD algorithm for computing the greatest common divisor of large integers in Elixir.

Links

License

Apache-2.0

Downloads

5 5
this version
11 11
yesterday
11 11
last 7 days
11 11
all time

Versions (3)

1.0.2 Jul 21, 2025
1.0.1 Jul 20, 2025
1.0.0 Jul 20, 2025

Dependencies (3)

binary_gcd ~> 1.1
bit_length ~> 1.0
nstandard ~> 0.1

Recent Activity

Jul 21, 2025 Publish documentation for release 1.0.2
Jul 21, 2025 Publish release 1.0.2
Jul 20, 2025 Publish documentation for release 1.0.1
Jul 20, 2025 Publish release 1.0.1
Jul 20, 2025 Publish documentation for release 1.0.0
Jul 20, 2025 Publish release 1.0.0

Show All Activities

Config

mix.exs

rebar.config

erlang.mk

Checksum

Build Tools

mix

Owners

zacky1972

Publisher

Dependents (3)

prime_factorization, a_k_s_primality_test, fermat_primality_test, show all...