calculating gcd and lcm of two numbers, using reduce for multiple numbers

gcd_and_lcm.py

#using python 3.5
import functools
# standard euclidean algorithm
def gcd(a, b):
    while b:
        a, b = b, a%b
    return a

# with explicit recursion
def gcd_multiple(a, b):
    if b==0:
        return a
    else:
        return gcd_multiple(b, a%b)
      
      
# calculating the gcd of more than two numbers

def gcd_multiple(*args):
    return functools.reduce(lambda x, y:gcd(x, y), args)

#modify to accomodate numbers in a list (array)