def gcd_recur(a, b):
    """
    Euclide's trick to calculate gcd: perfect for applying recursion

    a, b: positive integers
    returns: a positive integer, the greatest common divisor of a & b.
    """
    if b == 0:
        return a
    else:
        return gcd_recur(b, a % b)