GCD

# paulogp
def GCD(a, b):
    assert a >= b # a must be the larger number
    while (b != 0):
        remainder = a % b
        a, b  = b, remainder

    return a

# exemplo
print(GCD(10, 5))