Question: Need some help for these tutorial questions . 6. Use the extended Euclidean algorithm as presented in lectures to show that 63 and 110 are
Need some help for these tutorial questions .
6. Use the extended Euclidean algorithm as presented in lectures to show that 63 and 110 are relatively prime, and to nd the reciprocal of 63 modulo 110. Show your working.
7. Use the Euclidean algorithm as presented in lectures to nd gcd(84,124) and use this to nd lcm(84,124).
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
