igorvanloo · December 11, 2021 11:22
diff --git a/lcm.py b/lcm.py
 def lcm(numbers):
    n = sorted(numbers) #I want to start with the largest numbers
    curr = n.pop(-1) #Remove the biggest
    while len(n) != 0:
        temp = n.pop(-1)
        curr = int(abs(curr*temp)/math.gcd(curr, temp)) #Continuously find the lcm between the 2 largest numbers
    return curr
	def lcm(numbers):
	n = sorted(numbers) #I want to start with the largest numbers
	curr = n.pop(-1) #Remove the biggest
	while len(n) != 0:
	temp = n.pop(-1)
	curr = int(abs(curr*temp)/math.gcd(curr, temp)) #Continuously find the lcm between the 2 largest numbers
	return curr