a. Find empirically the largest number of divisions made by Euclid’s algorithm for computing gcd(m, n) for 1≤ n ≤ m ≤ 100.
b. For each positive integer k, find empirically the smallest pair of integers 1≤ n ≤ m ≤ 100 for which Euclid’s algorithm needs to make k divisions in order to find gcd(m, n).
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.