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