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

first anwser choice.

step-by-step explanation:

the greater/less or equal to symbol (> or < with the line at the bottom) is a closed/filled in circle.

-5c + 2 _< _27

subtract from both sides by 2

-5c _< _ 27

divide both sides by -5

c _< _ 5.4

flip the inequality sign

c _> _5.4

the only possible answer that would match the simplified inequality is the first answer choice

false

step-by-step explanation: