GCD and LCM functions in Python for several numbers

gcd_and_lcm.py

# Greatest common divisor of 1 or more numbers.
from functools import reduce


def gcd(*numbers):
    """
    Return the greatest common divisor of 1 or more integers

    Examples
    --------
    >>> gcd(5)
    5
    >>> gcd(30, 40)
    10
    >>> gcd(120, 40, 60)
    20
    """
    # Am I terrible for doing it this way?
    from math import gcd

    return reduce(gcd, numbers)

# Least common multiple is not in standard libraries? It's in gmpy, but this
# is simple enough:


def lcm(*numbers):
    """
    Return lowest common multiple of 1 or more integers.

    Examples
    --------
    >>> lcm(5)
    5
    >>> lcm(30, 40)
    120
    >>> lcm(120, 40, 60)
    120
    """
    def lcm(a, b):
        return (a * b) // gcd(a, b)

    return reduce(lcm, numbers, 1)

# Assuming numbers are positive integers...

Use this line of code to take LCM. Its fast and give you LCM of multiple numbers

import numpy as np
divisor_list = [3,4,5,6,7,2]
int(np.lcm.reduce(divisor_list))

Use this line of code to take LCM. Its fast and give you LCM of multiple numbers

import numpy as np
divisor_list = [3,4,5,6,7,2]
int(np.lcm.reduce(divisor_list))

Thanks alot

It's not mentioned here, but this is the Euclidean algorithm for computing the GCD: https://en.wikipedia.org/wiki/Euclidean_algorithm

Love how short the code is!

def find_gcd(a,b):
gcd = 1
for i in range(1,a+1):
if a%i==0 and b%i==0:
gcd = i
return gcd

first = int(input('Enter first number: '))
second = int(input('Enter second number: '))

print('HCD of %d and %d is %d' %(first, second, find_gcd(first, second)))

lcm = first * second / find_gcd(first, second)
print('MCM of %d and %d is %d' %(first, second, lcm))
print("azam")