GCD, Greatest Common Divisor
Finds the greatest common divisor of two integers using Euclid's algorithm.
GCD
6
Advertisement
Methodology
Greatest common divisor (Euclidean algorithm): repeatedly replace the larger number with the remainder until remainder is 0.
Example: GCD(48, 18) = 6
Methodology
GCD is found with Euclid's algorithm by repeated division with remainder.
Example
GCD(48, 18) = 6.