GCD |
GCD(number1 [,number2] [..]) |
Returns the greatest common divisor of two or more numbers. |
number1 | The first number. |
number2 | (Optional) The second number. |
REMARKS |
* This function returns the largest positive integer that can divide all the numbers without a remainder. * This function returns the largest positive [[Factor]] of all the numbers. * A prime number only has two factors, one and itself. * If any of the numbers are not whole numbers (or integers), then they are truncated. * If any of the arguments are less than zero (negative), then #NUM! is returned. * If any of the arguments are more than 2^53, then #NUM! is returned. * If any of the arguments are not numeric, then #VALUE! is returned. * You can have a maximum of 255 arguments. * You can use the LCM function to return the least common multiple of two or more numbers. * For the Microsoft documentation refer to support.microsoft.com * For the Google documentation refer to support.google.com |
|
1 - What is the greatest common divisor of 8 and 12. 2 - What is the greatest common divisor of 8 and 2. 3 - What is the greatest common divisor of 4, 8, 16 and 20. 4 - What is the greatest common divisor of 15, 35 and 60. 5 - What is the greatest common divisor of 5.9 and 2.1. Numbers that are not integers are truncated. 6 - What is the greatest common divisor of 5 and 2. 7 - What is the greatest common divisor of 6 and 2. 8 - What is the greatest common divisor of 0 and 0. 9 - Negative numbers that are passed as arguments generate an error. 10 - Text values that are passed as arguments generate an error. |
© 2024 Better Solutions Limited. All Rights Reserved. © 2024 Better Solutions Limited Top