3 gcd - compute greatest common divisor of two integers
11 The B<gcd> program computes the greatest common divisor of two
12 arbitrary-precision integers I<a> and I<b>. The result is written in
13 standard decimal notation to the standard output.
15 If I<b> is zero, B<gcd> will print an error message and exit.
19 invmod(1), isprime(1), lap(1)
23 Michael J. Fromberger <sting@linguist.dartmouth.edu>
24 Thayer School of Engineering, Hanover, New Hampshire, USA
26 $Date: 2000/07/14 00:44:32 $