Ump-code
gcd
-
g
reatest
c
ommon
d
ivisor
gcd(
A
,
B
)
gcd calculates greatest common divisor of the numbers
A
and
B
using the Euclidean algorithm.
A
and
B
must be integers.
gcd( 9, 6 ) equals 3.
See also
lcm