Create a gist now

Instantly share code, notes, and snippets.

# Finds the lowest common multiple
def lcm(deck):
p = 1
for i in range(0, len(deck)):
p = p * int(deck[i] / gcd(p, deck[i]))
return p
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment