7899
TOPICS
LATEST
ABOUT
AUTHORING AREA
PARTICIPATE
Your browser does not support JavaScript or it may be disabled!
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
SNAPSHOTS
DETAILS
A faster way to compute the LCM of two numbers
and
is
, which can take advantage of the efficiency of the Euclidean algorithm.
RELATED LINKS
Multiple
(
Wolfram
MathWorld
)
Least Common Multiple
(
Wolfram
MathWorld
)
Euclidean Algorithm
(
Wolfram
MathWorld
)
PERMANENT CITATION
"
Finding the Least Common Multiple of Two Numbers by Factoring
" from
the Wolfram Demonstrations Project
http://demonstrations.wolfram.com/FindingTheLeastCommonMultipleOfTwoNumbersByFactoring/
Contributed by:
Jesse Nochella
Share:
Embed Interactive Demonstration
New!
Download Demonstration as CDF »
Download Source Code »
(preview »)
Files require
Wolfram
CDF Player
or
Mathematica
.
Related Demonstrations
More by Author
Finding the Greatest Common Divisor of Two Numbers by Factoring
Jesse Nochella
Factor Trees
Jesse Nochella
The Euclidean Algorithm and Simple Continued Fractions
?tefan Porubský
Extended Euclidean Algorithm
?tefan Porubský
The Euclidean Algorithm
Matthew Szudzik
Euclidean Algorithm Steps
Michael Trott
Relatively Prime Numbers and Zeta(2)
Okay Arik
Proposition 7, Book XII, Euclid's Elements
Izidor Hafner
Proposition 3, Book XII, Euclid's Elements
Izidor Hafner
Proposition 30, Book XI, Euclid's Elements
Izidor Hafner
Related Topics
Euclid's Elements
Greek Mathematics
Number Theory
Elementary School 3-5 Mathematics
Browse all topics
Contribute
Make a new version of this Demonstration
Upload a new Demonstration
Note: To run this Demonstration you need Mathematica 7+ or the free Mathematica Player 7EX
Download or upgrade to
Mathematica Player 7EX
I already have
Mathematica Player
or
Mathematica 7+