Show All

Hide All

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.

If this function is not available, and returns the #NAME? error, install and load the Analysis ToolPak add-in.

Syntax

GCD(number1,number2, ...)

Number1, number2, ...   are 1 to 29 values. If any value is not an integer, it is truncated.

Remarks

• 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.

Example

The example may be easier to understand if you copy it to a blank worksheet.