File: gcd.pod

package info (click to toggle)
iceape 1.0.8-4
  • links: PTS
  • area: main
  • in suites: etch-m68k
  • size: 271,360 kB
  • ctags: 283,957
  • sloc: cpp: 1,724,223; ansic: 919,481; xml: 97,519; makefile: 45,358; asm: 34,831; perl: 28,306; sh: 26,360; cs: 6,232; java: 5,329; python: 3,077; lex: 423; php: 244; yacc: 238; pascal: 230; sql: 146; csh: 132; objc: 97; ada: 49; awk: 14; sed: 4
file content (27 lines) | stat: -rw-r--r-- 576 bytes parent folder | download | duplicates (18) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
 
=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: 2000/07/14 00:44:32 $