Answer to Question #274505 in Python for Holik

Question

10. The Euclidean algorithm is the largest divisor of the numbers A and B.

trace in the report.

Answer 1

def euclide(m, n):
    while True:
        if m > n:
            n, m = m, n
        if n % m:
            n, m = m, n % m
        else:
            return m