LCM, GCD, and MOD

This Demonstration illustrates the concepts of the least common multiple (LCM) and the greatest common divisor (GCD). It depends on explicit factoring; the factorization is used to show the GCD and LCM. The Euclidean algorithm finds the GCD much more efficiently because it does not rely on factoring. In any case, you can find the LCM of

a

and

b

from the GCD:

LCM(a,b)=ab/GCD(a,b)

.

You can also see how to perform some basic modular arithmetic.

External Links

Euclidean Algorithm (Wolfram MathWorld)

Greatest Common Divisor (Wolfram MathWorld)

Least Common Multiple (Wolfram MathWorld)

Modular Arithmetic (Wolfram MathWorld)

Permanent Citation

Abigail Nussey

"LCM, GCD, and MOD"
http://demonstrations.wolfram.com/LCMGCDAndMOD/
Wolfram Demonstrations Project
Published: December 4, 2007