# Lehmer gcd v1.0.3 - Table of Contents

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

## Pages

- [Lehmer gcd](readme.md)
- [LICENSE](license.md)
- [Changelog](changelog.md)
- [AGENTS.md](agent.md)

## Modules

- [LehmerGcd](LehmerGcd.md): Implementation of the Lehmer GCD algorithm for computing the greatest common divisor
of two non-negative integers.

