| Line 10: | Line 10: | ||
The greatest common divisor of two nonzero integers a and b is the largest of all common divisors of a and b. | The greatest common divisor of two nonzero integers a and b is the largest of all common divisors of a and b. | ||
</p> | </p> | ||
| + | |||
| + | '''LCM:''' The least common multiple of two nonzero integers a and b is the smallest positive integer that is a multiple of both a and b. | ||
--[[User:Jmcdorma|Jmcdorma]] 12:16, 5 February 2009 (UTC) | --[[User:Jmcdorma|Jmcdorma]] 12:16, 5 February 2009 (UTC) | ||
Revision as of 13:21, 5 February 2009
Euclid
a = qb + r with 0 <= r < b
where a,b,q,r are integers
--ERaymond 12:26 29 January 2009 (UTC)
GCD: The greatest common divisor of two nonzero integers a and b is the largest of all common divisors of a and b.
LCM: The least common multiple of two nonzero integers a and b is the smallest positive integer that is a multiple of both a and b.
--Jmcdorma 12:16, 5 February 2009 (UTC)
