**Write a program to compute gcd,lcm of two numbers**

The least common multiple (LCM) of two integers is the smallest positive integer that is a multiple of both. The greatest common divisor (GCD) of two integers is the largest positive integer dividing both. The product of the two numbers is equal to the product of the LCM and the GCD.

following is the formula :

** a x b = LCM(a, b) * GCD (a, b)**

**Program 1**

**def gcd(x, y):**

** while(y):**

** x, y = y, x % y**

** return x**

**# This function computes LCM**

**def lcm(x, y):**

** lcm = (x*y)//gcd(x,y)**

** return lcm**

**num1 = 60**

**num2 = 48 **

**print("The L.C.M. is", lcm(num1, num2))**

**print("GCD of two numbers is ",gcd(num1,num2))**

**Output**

The L.C.M. is 240

GCD of two numbers is 12

**Program 2**

**#gcd solution**

**import math **

**print ("The gcd of 60 and 48 is : ",math.gcd(60,48)) **

**#lcm**

**import numpy as np**

**print("lcm of 10 and 15 is : ",np.lcm(60, 48) **

**Output **

The gcd of 60 and 48 is : 12

Lcm of 60 and 48 is : 240

**For more Rajasthan Technical University CSE VI Sem Python Lab Experiments Click here**