Euclid’s Algorithm
Home
>
Mathematics
>
Number theory
>
Modular arithmetic
>
Euclid’s Algorithm
A quick and efficient way to find the greatest common divisor of two integers.