(algorithm)
Definition: An algorithm to find the greatest common divisor, g, of two positive integers, a and b, and coefficients, h and j, such that g = ha + jb.
See also Euclid's algorithm.
Note: These coefficients are useful for computing modular multiplicative inverses. After [CLR90, page 811].
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black (paul.black@nist.gov).
Entry modified Thu Aug 23 14:08:36 2001.
HTML page formatted Thu Jan 31 13:48:25 2002.
This page's original URL is http://www.nist.gov/dads/HTML/extendEuclid.html