Packages

lehmer_gcd

1.0.3
1.0.3 1.0.2 1.0.1 1.0.0

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

HexDocs

Current section

3 Dependants

Jump to
Readme
4 Versions
3 Dependencies
3 Dependants
Files
Activity

Packages depending on lehmer_gcd

3 packages
  • a_k_s_primality_test v1.1.1 requires ~> 1.0

    A pure Elixir implementation of the AKS (Agrawal-Kayal-Saxena) primality test algorithm.

    Updated about 1 year ago

    257
    recent downloads
  • prime_factorization v1.1.0 requires ~> 1.0

    A fast and efficient Elixir library for prime factorization of integers.

    Updated about 1 year ago

    66
    recent downloads
  • fermat_primality_test v1.0.0 requires ~> 1.0

    A probabilistic primality test implementation in Elixir based on Fermat's Little Theorem.

    Updated about 1 year ago

    39
    recent downloads
3 packages of 3 total

Checksum

Dependency Config

mix.exs

rebar.config

Gleam

erlang.mk

Package Details

Downloads Last 30 days, all versions
0 5 10 15 20

this version

70

yesterday

0

last 7 days

40

all time

463

Last Updated

Jul 05, 2026

License

Apache-2.0

Build Tools

mix

Publisher

zacky1972 zacky1972

Links

Owners