Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
Created GCD as Euclid Algorithm solution in Clear category for The Greatest Common Divisor by Stensen
def gcd(a, b):
if a == 0: return b
return gcd(b%a, a)
def greatest_common_divisor(*args):
_gcd = args[0]
for i in args[1:]: _gcd = gcd(_gcd, i)
return _gcd
Sept. 27, 2020
