GCD:
Returns the greatest common divisor
The GCD function 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 takes
1 required argument and
254 optional arguments:
Syntax: GCD(number1,
[number2], ...
)
The arguments for the GCD function are:
Argument

Required?

Description

number1, number2, ... 
Required 
number1 is required, subsequent numbers are optional. 1 to 255 values. If any value is not an integer, it is truncated. 
• If any argument is nonnumeric, GCD returns the #VALUE! error value. 
• If any argument is less than zero, GCD returns the #NUM! error value. 
• One divides any value evenly. 
• A prime number has only itself and one as even divisors. 
• If a parameter to GCD is >=2^53, GCD returns the #NUM! error value. 
The GCD function returns the greatest common divisor of two or more integers.