Euclidean algorithm
Euclid’s algorithm is an efficient method for computing the greatest common divisor of two integers. It is named after the ancient Greek mathematician Euclid, who first described it in his Elements. The algorithm was proven by Gabriel Lamé in 1844, and marks the beginning of computational complexity theory. It has many theoretical and practical applications, including being used to prove...
