LCM of Two Numbers In C Language

In C language, you can find the least common multiple (LCM) of two numbers by first finding the greatest common divisor (GCD) of the two numbers, and then dividing their product by the GCD.

Here's an example of C code that finds the LCM of two numbers:

Copy code

#include <stdio.h> int gcd(int a, int b) {    if (b == 0) {        return a;    }    return gcd(b, a % b); } int lcm(int a, int b) {    return (a * b) / gcd(a, b); } int main() {    int a, b;    printf("Enter two positive integers: ");    scanf("%d%d", &a, &b);    printf("The LCM of %d and %d is %d.\n", a, b, lcm(a, b));    return 0; }

This code prompts the user to enter two positive integers, and then calls the lcm() function with those two numbers as arguments. The lcm() function first calls the gcd() function to find the GCD of the two numbers, and then uses the formula (a * b) / gcd(a, b) to calculate the LCM. It then prints the LCM of the two numbers. This code uses the GCD function which I have explained in the previous answer, it first finds the gcd of two numbers and then LCM is found by dividing the product of two numbers with gcd.