Thus, Euclid's algorithm, which computes the GCD of two integers, suffices to calculate the GCD of arbitrarily many integers.
Thus Euclid's algorithm, which com,putes the GCD of two integers, suffices to calculate the GCD of arbitrarily many integers.