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

-362

step-by-step explanation:

(12)(4)+2(12)-34(12)+2(12)-3

  \/         \/         \/         \/

  48 +   24 -   408 + 24 - 3

      \   /               \   /

          72     -     432 - 3 = -363