Write a function gcd(x, y)that returns the greatest common divisor of the parameters candy. you can use the euclidean algorithm, which uses the fact that gcd(x, y) = gcd(modx, x). say you want to nd the gcd of 462 and 1071

Explanation:

In some language, the function can be written recursively using the correct Euclidean algorithm as ...

  gcd[y_, x_] := If[Mod[y,x]==0, x, gcd[x, Mod[y,x]]]

Using this on the given numbers, you get ...

  gcd[462, 1071] = 21

answer: 42

use a calculator to find that 845/73 = 11.575

the whole part of the answer is 11. multiply this by 73 to get 11*73 = 803.

subtract that result from 845 to get 845 - 803 = 42