GCD function
From Apache OpenOffice Wiki
< Documentation | How Tos
The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.
Trigonometric
Hyperbolic
Rounding and remainders
Logarithm/Powers
Bessel functions
Miscellaneous
GCD
Returns the greatest common divisor of two or more integers.
Syntax:
GCD(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.
Example:
GCD(16; 32; 24)
- returns 8, because 8 is the largest number that can divide 16, 24 and 32 without a remainder.
GCD(B1:B3)
- where cells B1, B2, and B3 contain 9, 12, and 6 returns 3.
GCD(3; 5)
- returns 1.
See Also
