1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/security/nss/lib/freebl/mpi/doc/gcd.pod Wed Dec 31 06:09:35 2014 +0100
1.3 @@ -0,0 +1,28 @@
1.4 +# This Source Code Form is subject to the terms of the Mozilla Public
1.5 +# License, v. 2.0. If a copy of the MPL was not distributed with this
1.6 +# file, You can obtain one at http://mozilla.org/MPL/2.0/.
1.7 +
1.8 +=head1 NAME
1.9 +
1.10 + gcd - compute greatest common divisor of two integers
1.11 +
1.12 +=head1 SYNOPSIS
1.13 +
1.14 + gcd <a> <b>
1.15 +
1.16 +=head1 DESCRIPTION
1.17 +
1.18 +The B<gcd> program computes the greatest common divisor of two
1.19 +arbitrary-precision integers I<a> and I<b>. The result is written in
1.20 +standard decimal notation to the standard output.
1.21 +
1.22 +If I<b> is zero, B<gcd> will print an error message and exit.
1.23 +
1.24 +=head1 SEE ALSO
1.25 +
1.26 +invmod(1), isprime(1), lap(1)
1.27 +
1.28 +=head1 AUTHOR
1.29 +
1.30 + Michael J. Fromberger <sting@linguist.dartmouth.edu>
1.31 + Thayer School of Engineering, Hanover, New Hampshire, USA
