Send the following on WhatsApp
Continue to ChatQ17 Write a function to compute the greatest common divisor given by Euclid's algorithm, exemplified for J=1980, K=1617 as follows: Thus, the greatest common divisor is 33. https://www.easterscience.com/q17-write-a-function-to-compute-the-greatest-common-divisor-given-by-euclids-algorithm-exemplified-for-j1980-k1617-as-follows-thus-the-greatest-common-divisor-is-33/