Algorithm


  1. Input: Accept two numbers from the user or use predefined values.

  2. Find the greater number: Determine the greater of the two numbers. Let's call it greater.

  3. Initialize a variable for LCM: Set lcm to the value of the greater number.

  4. Start a loop: Begin a loop that continues until a break condition is met.

  5. Check divisibility: Inside the loop, check if both numbers are divisible by lcm. If they are, break out of the loop.

  6. Update LCM: If not divisible, increment lcm by the value of the greater number.

  7. Output: Print or return the LCM.

 

Code Examples

#1 Code Example- Program to Compute LCM

Code - Python Programming

# Python Program to find the L.C.M. of two input number

def compute_lcm(x, y):

   # choose the greater number
   if x > y:
       greater = x
   else:
       greater = y

   while(True):
       if((greater % x == 0) and (greater % y == 0)):
           lcm = greater
           break
       greater += 1

   return lcm

num1 = 54
num2 = 24

print("The L.C.M. is", compute_lcm(num1, num2))
Copy The Code & Try With Live Editor

Output

x
+
cmd
The L.C.M. is 216

#2 Code Example- Program to Compute LCM Using GCD

Code - Python Programming

# Python program to find the L.C.M. of two input number

# This function computes GCD 
def compute_gcd(x, y):

   while(y):
       x, y = y, x % y
   return x

# This function computes LCM
def compute_lcm(x, y):
   lcm = (x*y)//compute_gcd(x,y)
   return lcm

num1 = 54
num2 = 24 

print("The L.C.M. is", compute_lcm(num1, num2))
Copy The Code & Try With Live Editor
Advertisements

Demonstration


Python Programing Example to Find LCM-DevsEnv