Find the greatest common divisor of two positive whole numbers.
Method
The calculator uses the Euclidean algorithm, repeatedly replacing a pair with the smaller number and the remainder.
Example: GCD(48, 18) = 6.
Find the greatest common divisor of two positive whole numbers.
The calculator uses the Euclidean algorithm, repeatedly replacing a pair with the smaller number and the remainder.