The GCD function calculates the greatest common divisor of a list of integers. The greatest common divisor is the largest integer that exactly divides all the integers in a list.
For example:
GCD(24, 36) returns 12
GCD(24, 36, 72) returns 12
GCD(2, 7, 9) returns 1
See also: