LCM, GCD, and MOD
Requires a Wolfram Notebook System
Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.
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 and from the GCD: .[more]
You can also see how to perform some basic modular arithmetic.[less]
Contributed by: Abigail Nussey (March 2011)
Open content licensed under CC BY-NC-SA
"LCM, GCD, and MOD"
Wolfram Demonstrations Project
Published: March 7 2011