Returns the greatest common divisor of two or more integers.
This function is only available if the Analysis AddIn is installed.
GCD_ADD(integer1; integer2; ... integer30)
- integer1 to integer30 are up to 30 integers or ranges of integers whose greatest common divisor is to be calculated.
- The greatest common divisor (or highest common factor) is the largest positive integer which will divide, without remainder, each of the given integers.
GCD_ADD(16; 32; 24)
- returns 8, because 8 is the largest number that can divide 16, 24 and 32 without a remainder.
- where cells B1, B2, and B3 contain 9, 12, and 6 returns 3.
- returns 1.
The ODFF international standardisation of the GCD / GCD_ADD functions will allow both functions to produce precisely the same results.