Question: question 1 Using Euclid's Algorithm (but NOT the Extended Euclid's Algorithm!) , find the GCD of the following numbers: (A) 1001 and 1309 (B) 159037
question 1
Using Euclid's Algorithm (but NOT the Extended Euclid's Algorithm!) , find the GCD of the following numbers:
(A) 1001 and 1309 (B) 159037 and 92263
(Check your solutions at the end by using the command gcd(a,b) ).
NOTE: in your calculations you can use the Maple command iquo(a,b),
question 2
For each of the following equations decide whether it is consistent or not (explain your answer). If it is, find all solutions using the EEA algorithm, and identify the solution with the smallest absolute value of x
(A) 44 = 121 x + 935 y
(B) 3 = 870 x + 327 y
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
