Greatest Common Divisor (GCD)

The GCD of two integers is the largest positive integer that divides both of them without leaving a remainder. The Euclidean algorithm is used to find the GCD of two integers.