Finding the Greatest Common Divisor of Two Numbers by Factoring
You can find the greatest common divisor (GCD) of two numbers by multiplying together all the prime factors they have in common.
Contributed by:
Jesse Nochella
X
X
X
Show Source Code
|
Download Source Code Notebook
Show Initialization Code
A much more efficient way of computing GCDs has been known for the past 2300 years. Named the Euclidean Algorithm, it is one of the oldest mathematical procedures known, appearing in Euclid's
Elements
around 300 BC.
Divisor
(
Wolfram
MathWorld
)
Greatest Common Divisor
(
Wolfram
MathWorld
)
Euclidean Algorithm
(
Wolfram
MathWorld
)
"
Finding the Greatest Common Divisor of Two Numbers by Factoring
" from
The Wolfram Demonstrations Project
http://demonstrations.wolfram.com/FindingTheGreatestCommonDivisorOfTwoNumbersByFactoring/
Contributed by:
Jesse Nochella
Elementary School Mathematics
Euclid's Elements
Greek Mathematics
Number Theory
Finding the Least Common Multiple 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)
Divisors of a Number
Patterns in Partitions of Integers
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
