Least Common Multiple and Greatest Common Divisor

Requires a Wolfram Notebook System
Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.
The least common multiple (LCM) of two integers is the smallest positive integer that is a multiple of both. The greatest common divisor (GCD) of two integers is the largest positive integer dividing both. The product of the two numbers is the product of the LCM and the GCD.
Contributed by: Jacqueline D. Wandzura (March 2011)
Open content licensed under CC BY-NC-SA
Snapshots
Details
detailSectionParagraphPermanent Citation
"Least Common Multiple and Greatest Common Divisor"
http://demonstrations.wolfram.com/LeastCommonMultipleAndGreatestCommonDivisor/
Wolfram Demonstrations Project
Published: March 7 2011