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

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