NAME

gcd - determine greatest common divisor of two integers

SYNOPSIS


long_int function gcd (x0, x1)
long_int x0, x1


DESCRIPTION

'Gcd' determines the greatest common divisor of the two long integers
specified as arguments.
The function return is the GCD (always positive).

IMPLEMENTATION

'Gcd' is a straightforward implementation of Euclid's algorithm.

BUGS

Behavior with nonpositive arguments may be considered irrational
by some.

SEE ALSO

invmod (4)