GCD(number1, number2, .....)

GCD() calculates the 'Greatest Common Divisor' of two or more integers.

Description

For Example,

GCD(25,100) returns 25

The divisors for '25' are 1,5,5.

The divisors for '100' are 1,2,2,5,5.

So, common divisors are 1,5,5. Hence the GCD(25,100) is '25'.

GCD value is the largest interger that divides the input numbers without a remainder.
If any 'number' is nonnumeric, Calci displays an #ERROR message.
If any 'number' is negative, Calci displays an #ERROR message.
For only one 'number' is entered, Calci assumes the second number to be '0'.
If any 'number' is not an integer, it is truncated.