lcm.py

def gcd(a, b):
    """
    An efficient algorithm to compute GCD \n
    a is a number \n
    b is the other number \n
    no other arguments
    """
    if b == 0:
        return a
    ap = a % b
    return gcd(b, ap)


def lcm(a, b):
    """
    An efficient algorithm to calculate LCM \n
    This algorithm works efficiently.
    """
    return a * b / gcd(a, b)

Important edit

Replace LCM function with this:

def lcm(a, b):
    """
    An efficient algorithm to calculate LCM \n
    This algorithm works efficiently.
    """
    return a * b // gcd(a, b)

More detail on edit

It is being changed to integer multiplication.
The line that needs to be changed is this

return a * b / gcd(a, b)

With this

return a * b // gcd(a, b)

Be awesome
-Sharan Sajiv Menon