Finding the Least Common Multiple of Two Numbers by Factoring
You can find the least common multiple (LCM) of two numbers by multiplying together the highest power of each factor found in either number.
Contributed by:
Jesse Nochella
X
X
X
Show Source Code
|
Download Source Code Notebook
Show Initialization Code
A faster way to compute the LCM of two numbers
and
is
, which can take advantage of the efficiency of the Euclidean algorithm.
Multiple
(
Wolfram
MathWorld
)
Least Common Multiple
(
Wolfram
MathWorld
)
Euclidean Algorithm
(
Wolfram
MathWorld
)
"
Finding the Least Common Multiple of Two Numbers by Factoring
" from
The Wolfram Demonstrations Project
http://demonstrations.wolfram.com/FindingTheLeastCommonMultipleOfTwoNumbersByFactoring/
Contributed by:
Jesse Nochella
Elementary School Mathematics
Euclid's Elements
Greek Mathematics
Number Theory
Finding the Greatest Common Divisor of Two Numbers by Factoring
Factor Trees
The Euclidean Algorithm
Euclidean Algorithm Steps
Squaring a Number
Least Common Multiple and Greatest Common Divisor
Relatively Prime Numbers and Zeta(2)
Areas in a Multiplication Table
Divisors of a Number
Proposition 3, Book XII, Euclid's Elements
Make a new version of this Demonstration
Upload a new Demonstration
Contact The Wolfram Demonstrations Project Team
Site Index
Wolfram Research
© 2008
The Wolfram Demonstrations Project & Contributors
Terms of Use
Privacy Policy
RSS
Atom
