def gcd(m, n):
    """(int, int) -> int
    Uses Euclid's method to compute the greatest common factor
    (greatest common divisor) of two integers, <m> and <n>
    Returns greatest common factor (gcd) of the two integers
    """
    
    if n == 0:
        result = m
    else:
        result = gcd(n, m % n)
    
    return result