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
Understanding the Least Common Multiple and Greatest Common Divisor
Gustavo Delfino
Finding the Greatest Common Divisor of Two Numbers by Factoring
Jesse Nochella
Finding the Least Common Multiple of Two Numbers by Factoring
Jesse Nochella
Common-Factor Graph of Fibonacci Numbers
Aaron Dunigan AtLee
The Divisor Sigma Function
Michael Croucher
Odd and Even Values of Divisor Functions
Giovanna Roda
Hasse Diagrams of Integer Divisors
Jaime Rangel-Mondragon
Sum of Powers of Divisors
Jon Perry
Divisors of a Number
Stephen Wolfram
Gaussian Divisors of an Integer
Stephen Wolfram
