def gcd_recursive_by_divrem(m, n):
    """
    Computes the greatest common divisor of two numbers by recursively getting remainder from
    division.

    :param int m: First number.
    :param int n: Second number.

    :returns: GCD as a number.
    """
    if n == 0:
        return m
    return gcd_recursive_by_divrem(n, m % n)