1) Use the Euclidean Algorithm to nd the greatest common divisor of 71407 and 2020. (Write down all of the steps, so that you are ready).
2) Use the method of back substitution to nd integers x; y such that 71407x + 2020y = d, where d = gcd(71 407, 2020).
3) Use the array method to solve the equation in (b).
4) Explain, why there is no solution in integer numbers of the equation 71407x + 2020y = 1?

Step-by-step explanation:

We have

So we find GCD = 1

2) By back substitution we get

71407 (543) - 19387(2000) =1

So x = 543 and y = -19387

Because we got 71407 (543) - 19387(2000) =1

y cannot be positive

y can only be negative

10/60

step-by-step explanation:

if you divide 10 by 60 the answer is 0.166666 while if you divide or solve the other problems it equals 0.6

javeir earned 56 dollors more than kyle so kyle and javier had 14w but javier made 56 dollors more so 14w plus 56 equals 70w so kyle has 14w

step-by-step explanation: hope i plz give me brainliest with the points so this is not constant cause it says last week so its clearly not every week