Get the greatest common divisor of two or more numbers
A number representing the largest positive integer that divides the numbers without a remainder
=GCD (number1, [number2], …)
- number1 – The first number.
- number2 – [optional] The second number.
Use the GCD function to get the greatest common divisor of two or more integers. The greatest common divisor is the largest positive integer that divides the numbers without a remainder. For example, The formula =GCD(60,36) returns the number 12, since 12 is the largest factor that goes into both numbers evenly.
The GCD function can accept up to 255 numbers as arguments.