/security/nss/lib/freebl/mpi/doc/gcd.pod

http://github.com/zpao/v8monkey · Unknown · 27 lines · 15 code · 12 blank · 0 comment · 0 complexity · ad97378718e67de54f525f4a543f8c98 MD5 · raw file 

    

  1. =head1 NAME
    2. 

  2. 

  3.  gcd - compute greatest common divisor of two integers
    4. 

  4. 

  5. =head1 SYNOPSIS
    6. 

  6. 

  7.  gcd <a> <b>
    8. 

  8. 

  9. =head1 DESCRIPTION
    10. 

  10. 

  11. The B<gcd> program computes the greatest common divisor of two
    12. 

  12. arbitrary-precision integers I<a> and I<b>.  The result is written in
    13. 

  13. standard decimal notation to the standard output.
    14. 

  14. 

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

  16. 

  17. =head1 SEE ALSO
    18. 

  18. 

  19. invmod(1), isprime(1), lap(1)
    20. 

  20. 

  21. =head1 AUTHOR
    22. 

  22. 

  23.  Michael J. Fromberger <sting@linguist.dartmouth.edu>
    24. 

  24.  Thayer School of Engineering, Hanover, New Hampshire, USA
    25. 

  25.  
    26. 

  26.  $Date: 2000/07/14 00:44:32 $
    27.