lehmer_gcd 1.0.1

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

License

Apache-2.0

Downloads

0 20 40 60 80 Last 30 days, all versions
  • 0 0
    this version
  • 0 0
    yesterday
  • 0 0
    last 7 days
  • 0 0
    all time

Versions (2)

Dependencies (3)

Recent Activity

  • 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

Publisher

zacky1972

Dependents (1)

prime_factorization, show all...