GCD Returns the greatest common divisor of two or more integers. The greatest common divisor is the largest integer that divides both number1 and number2 without a remainder.
GCD(number1, [number2], ...)
number1, number2, … Number1 is required, subsequent numbers are optional. 1 to 255 values. If any value is not an integer, it is truncated.
The greatest common divisor of two or more integers.