LCM, GCD, and MOD

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram CDF Player or other Wolfram Language products.

Requires a Wolfram Notebook System

Edit on desktop, mobile and cloud with any Wolfram Language product.

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


Snapshots


Details

detailSectionParagraph


Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.
Send