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

Mathematica Code

Converted by Mathematica August 20, 2002