Euclid’s Algorithm for Computing the Greatest Common Divisor
Number Theory An algorithm from ancient Greece Euclid of Alexandria [Source] The task is straightforward. Given two positive integer numbers x and y, we want to compute their greatest common divisor, i.e., the largest number that divides both x and y without a remainder. For example, suppose that x = 30 and y = 12. It is easy to factor these two numbers and write x = […]
