11,000+
Interactive Demonstrations Powered by Notebook Technology »
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!
Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site.
More details »
Download Demonstration as CDF »
Download Author 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
Platonic Solids
Stephen Wolfram and Eric W. Weisstein
Proposition 30, Book XI, Euclid's Elements
Izidor Hafner
Proposition 29, Book XI, Euclid's Elements
Izidor Hafner
Related Topics
Euclid's Elements
Greek Mathematics
Number Theory
Elementary School 3-5 Mathematics
Browse all topics
Related Curriculum Standards
US Common Core State Standards, Mathematics
4.OA.C.5
6.NS.B.4