The GCD
function finds the greatest common divisor
of a set of numbers.
- The syntax
for the function is GCD (number
1, number 2, ...number n).
Where "number
1, number2,...number n" are
numeric values or a reference to
values of which the greatest common divisor
is to be found.
The GCD function
takes the arguments and finds the greatest
common divisor. That is the largest
number that can divide both numbers.
For example GCD(6,8) = 2 as 2 goes
into 6 three times and 2 goes into
8 four times but they cannot be divided
by a number greater than 2 a whole
number of times..
This function can
be useful when simplifying
fractions as it is necessary to find the
largest divisor that can divide the numerator
and denominator a whole number of times in
order to "simplify" a fraction.
|
