Python LCM Algorithm

lcm.py

def gcd(a, b):
    """Return greatest common divisor using euclid's Algorithm
    ."""
    # Run while b is not equal to zero
    while b:
        a, b = b, a % b
        print "a: %d, b: %d." % (a, b)
    print "=" * 10
    return a
    
def lcm(a, b):
    """Return the lowest common multiple."""
    return a * b // gcd(a, b)
    
def lcmm(*args):
    """Return lcm of args."""
    return reduce(lcm, args)
    
print lcmm(1, 2, 3, 4, 5, 6, 7, 8, 9, 10)