LCM Program in C | GCD and LCM Program in C

1. LCM Program in C

In this program, the compiler will ask user to enter two positive integers other than zero. When the two numbers are accepted then the program will start doing its operation and finally print the LCM of two numbers.

C

1

#include <stdio.h>

2

int main()

3

{

4

int i, num1, num2, max, lcm=1;

5

/* Input two numbers from user */

6

printf("Enter any two numbers to find LCM: ");

7

scanf("%d%d", &num1, &num2);

8

/* Find maximum between num1 and num2 */

9

max = (num1 > num2) ? num1 : num2;

10

/* First multiple to be checked */

11

i = max;    

12

    /* Run loop indefinitely till LCM is found */

13

while(1)

14

{

15

 if(i%num1==0 && i%num2==0)

16

   {

17

    /*

18

    * If 'i' divides both 'num1' and 'num2'

19

    * then 'i' is the LCM.

20

    */

21

lcm = i;

22

    /* Terminate the loop after LCM is found */

23

 break;

24

  }

25

      /*

26

    * If LCM is not found then generate next 

27

      * multiple of max between both numbers

28

      */

29

    i += max;

30

    }

31

    printf("LCM of %d and %d = %d", num1, num2, lcm);

32

    return 0;

33

}

Output:

2. GCD program in C

C

1

#include <stdio.h>

2

int main()

3

{

4

int n1, n2, i, gcd;

5

    printf("Enter two integers: ");

6

    scanf("%d %d", &n1, &n2);

7

    for(i=1; i <= n1 && i <= n2; ++i)

8

    {

9

        // Checks if i is factor of both integers

10

        if(n1%i==0 && n2%i==0)

11

            gcd = i;

12

    }

13

    printf("G.C.D of %d and %d is %d", n1, n2, gcd);

14

    return 0;

15

}

Output:

3. Calculate LCM Using GCD

In this program, we have calculated the LCM using the concept of GCD.

C

1

#include <stdio.h>

2

int main() {

3

    int n1, n2, i, gcd, lcm;

4

    printf("Enter two positive integers: ");

5

    scanf("%d %d", &n1, &n2);

6

    for (i = 1; i <= n1 && i <= n2; ++i) {     

7

        // check if i is a factor of both integers

8

        if (n1 % i == 0 && n2 % i == 0)

9

            gcd = i;

10

    }

11

    lcm = (n1 * n2) / gcd;

12

    printf("The LCM of two numbers %d and %d is %d.", n1, n2, lcm);

13

    return 0;

14

}

Output:

4. LCM Program in C Using Recursion

The Recursion means the user-defined function which calls itself directly or indirectly. In this program, the compiler will ask you to enter two values and the print its LCM Using the recursive function.

C

1

#include <stdio.h>

2

long gcd(long x, long y);

3

int main()

4

{

5

    int Num1, Num2, GCD, LCM;

6

    printf("Please Enter two integer Values \n");

7

    scanf("%d %d", &Num1, &Num2);

8

    GCD = gcd(Num1, Num2);

9

    LCM = (Num1 * Num2) / GCD;

10

    printf("LCM of %d and %d is = %d", Num1, Num2, LCM);

11

    return 0;

12

}

13

long gcd(long x, long y) 

14

{

15

  if (y == 0) {

16

    return x;

17

  }

18

  else {

19

    return gcd(y, x % y);

20

  }

21

}

Output:

In the above program we have used the traditional LCM formula LCM=(Num1*Num2) / GCD;.

When the Compiler reaches to the line in the main gcd(long x, long y) the compiler will directly move to the function long gcd(long x, long y)

Let’s check above program condition’s if(y==0) will check whether the given number is 0 or not. In recursion, it’s very important to give the condition else that the program will execute infinitely.

Hope you understand the program with logic.