def GCD(x, y): while(y): x, y = y, x % y return x def generalizedGCD(nums): num1 = l[0] num2 = l[1] gcd = GCD(num1, num2) for i in range(2, len(l)): gcd = find_gcd(gcd, l[i]) return gcd
def GCD(x, y): while(y): x, y = y, x % y return x def generalizedGCD(nums): num1 = l[0] num2 = l[1] gcd = GCD(num1, num2) for i in range(2, len(l)): gcd = find_gcd(gcd, l[i]) return gcd