|
1 # This Source Code Form is subject to the terms of the Mozilla Public |
|
2 # License, v. 2.0. If a copy of the MPL was not distributed with this |
|
3 # file, You can obtain one at http://mozilla.org/MPL/2.0/. |
|
4 |
|
5 =head1 NAME |
|
6 |
|
7 gcd - compute greatest common divisor of two integers |
|
8 |
|
9 =head1 SYNOPSIS |
|
10 |
|
11 gcd <a> <b> |
|
12 |
|
13 =head1 DESCRIPTION |
|
14 |
|
15 The B<gcd> program computes the greatest common divisor of two |
|
16 arbitrary-precision integers I<a> and I<b>. The result is written in |
|
17 standard decimal notation to the standard output. |
|
18 |
|
19 If I<b> is zero, B<gcd> will print an error message and exit. |
|
20 |
|
21 =head1 SEE ALSO |
|
22 |
|
23 invmod(1), isprime(1), lap(1) |
|
24 |
|
25 =head1 AUTHOR |
|
26 |
|
27 Michael J. Fromberger <sting@linguist.dartmouth.edu> |
|
28 Thayer School of Engineering, Hanover, New Hampshire, USA |