Notes on Greatest Common Divisors
Kenneth M. Levasseur
Department of Mathematical Sciences
University of Massachusetts Lowell
Kenneth_Levasseur@uml.edu
Divisibility, Greatest common divisor
The Euclidean Algorithm
The "a s + b t = gcd(a,b) Theorem"
General solution to ![[Graphics:Images/gcd_gr_62.gif]](Images/gcd_gr_62.gif)
Mathematica Code
Mathematica version
Converted by Mathematica
August 20, 2002