How long does the recursive multiplication algorithm (shown in lecture) take to mul- tiply ann-bit numberxby anm-bit numbery? Justify your answer.
Compute gcd(630, 756) in the following two different ways. Show your steps.
(a) By finding the factorization of each number; (b) By using the Euclid algorithm.
What is the result of 23051(mod 7)? Show your steps.
Write a python program that calculates modular division using the extended Euclid algorithm, i.e., given two input parametersaandN, findxsuch that 0=x