security/nss/lib/freebl/mpi/doc/gcd.pod@b8a032363ba2
security/nss/lib/freebl/mpi/doc/gcd.pod
Thu, 22 Jan 2015 13:21:57 +0100
- author
- Michael Schloh von Bennewitz <michael@schloh.com>
- date
- Thu, 22 Jan 2015 13:21:57 +0100
- branch
- TOR_BUG_9701
- changeset 15
- b8a032363ba2
- permissions
- -rw-r--r--
Incorporate requested changes from Mozilla in review:
https://bugzilla.mozilla.org/show_bug.cgi?id=1123480#c6
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/.
5 =head1 NAME
7 gcd - compute greatest common divisor of two integers
9 =head1 SYNOPSIS
11 gcd <a> <b>
13 =head1 DESCRIPTION
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.
19 If I<b> is zero, B<gcd> will print an error message and exit.
21 =head1 SEE ALSO
23 invmod(1), isprime(1), lap(1)
25 =head1 AUTHOR
27 Michael J. Fromberger <sting@linguist.dartmouth.edu>
28 Thayer School of Engineering, Hanover, New Hampshire, USA
