Algorithm to Find LCM in C
- Find the maximum of the two numbers and store them in a variable max.
- Run a loop and check if max is divisible by both numbers.
- if (max % x == 0 && max % y == 0)
- If the condition is true, it means that max is the LCM of the two numbers.
- If the condition is false, increment max by 1 and continue the loop to check the next number.
LCM of Two Numbers in C
In this article, we will learn how to write a C program to find the LCM of two numbers. LCM (Least Common Multiple) of two numbers is the smallest positive number that can be divided by both numbers without leaving a remainder. For example, the LCM of 15 and 25 is 75.