The GCD (greatest common
divisor) function returns the greatest common divisor of one or more
integers. For example, the greatest common divisor for 30 and 42 is
6. The greatest common divisor is also called the highest common factor.
If any of the arguments
are missing, then the returned value is a missing value.