security/nss/lib/freebl/mpi/doc/gcd.pod
author Ryan VanderMeulen <ryanvm@gmail.com>
Wed, 01 May 2013 16:05:10 -0400
changeset 130538 05275490b9c18457c4459057a117afd6d6c9226d
parent 130535 0314d200873a8962e8556a656bbf9e4b26e23cfc
child 130699 c6f5c1bbcf761369c0d51f85ba1bb110f2f40fd8
permissions -rw-r--r--
Backed out changeset 0314d200873a (bug 858231) for Windows build bustage. CLOSED TREE

# This Source Code Form is subject to the terms of the Mozilla Public
# License, v. 2.0. If a copy of the MPL was not distributed with this
# file, You can obtain one at http://mozilla.org/MPL/2.0/.

=head1 NAME

 gcd - compute greatest common divisor of two integers

=head1 SYNOPSIS

 gcd <a> <b>

=head1 DESCRIPTION

The B<gcd> program computes the greatest common divisor of two
arbitrary-precision integers I<a> and I<b>.  The result is written in
standard decimal notation to the standard output.

If I<b> is zero, B<gcd> will print an error message and exit.

=head1 SEE ALSO

invmod(1), isprime(1), lap(1)

=head1 AUTHOR

 Michael J. Fromberger <sting@linguist.dartmouth.edu>
 Thayer School of Engineering, Hanover, New Hampshire, USA
 
 $Date$