Prove that if the Euclidean algorithm is applied to integers m and n, not both 0, then the last nonzero remainder is 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.