num02 - Number Theory Computing the GCD One way of...

Info iconThis preview shows pages 1–6. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Number Theory Computing the GCD One way of computing the GCD of two integers is listing all of their divisors and picking out the largest one common to each. pause But this is highly inefficient for large numbers. MAT 300 Awtrey MATHEMATICS AND STATISTICS 1 / 10 Number Theory Computing the GCD One way of computing the GCD of two integers is listing all of their divisors and picking out the largest one common to each. pause But this is highly inefficient for large numbers. A more efficient process involves repeated use of the Division Algorithm, and first appeared in Euclid’s book Elements . MAT 300 Awtrey MATHEMATICS AND STATISTICS 1 / 10 Number Theory Computing the GCD One way of computing the GCD of two integers is listing all of their divisors and picking out the largest one common to each. pause But this is highly inefficient for large numbers. A more efficient process involves repeated use of the Division Algorithm, and first appeared in Euclid’s book Elements . Consequently, this process is called the Euclidean Algorithm and it is fast... MAT 300 Awtrey MATHEMATICS AND STATISTICS 1 / 10 Number Theory Computing the GCD One way of computing the GCD of two integers is listing all of their divisors and picking out the largest one common to each. pause But this is highly inefficient for large numbers. A more efficient process involves repeated use of the Division Algorithm, and first appeared in Euclid’s book Elements . Consequently, this process is called the Euclidean Algorithm and it is fast...very fast! MAT 300 Awtrey MATHEMATICS AND STATISTICS 1 / 10 Number Theory The Euclidean Algorithm We are trying to compute gcd ( a ; b ) . Watch how we Apply the Division algorithm repeatedly until we get a remainder of 0....
View Full Document

This note was uploaded on 02/22/2011 for the course MAT 300 taught by Professor Thieme during the Spring '07 term at ASU.

Page1 / 24

num02 - Number Theory Computing the GCD One way of...

This preview shows document pages 1 - 6. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online