Assume that the extended Euclidean algorithm is applied to integers m and n, not both 0, and that the last nonzero remainder is
Use the strong principle of mathematical induction to prove
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.