Euclidean Algorithm

Abstract The ancient algorithm for calculating the greatest common divisor of two numbers is explained. Further, examples are given to show that the greatest common divisor of two numbers can be written as a linear combination of the two numbers. Two integers are relatively prime if and only the num... View More