Finds d=GCD(a,b) via the Euclidean algorithm and finds
integer m and n such that m*a+n*b=d.




This program performs the Euclidean algorithm on a and b
and finds m and n such that m*a+n*b=gcd(a,b).  The
output is pleasantly formatted to avoid confusion.  Uses
an iterative algorithm for finding m and n concurrently
with the GCD iterations.

Program written by Prof. Mark Janeba, Dept. of Math,
Willamette Univ, Salem, OR 97301  
(internet: mjaneba@willamette.edu)

Reference:  Any number theory text.