Question

a. Find gcd(31415, 14142) by applying Euclid’s algorithm.
b. Estimate how many times faster it will be to find gcd(31415, 14142)
by Euclid’s algorithm compared with the algorithm based on checking
consecutive integers from min{m, n} down to gcd(m, n).

Answer 1

Answer:

jdjsjjsjejjwjwowkwnsndbjdjejsndnndnd