# Program to find LCM of two numbers

LCM (Least Common Multiple) of two numbers is the smallest number which can be divided by both numbers.

For example LCM of 15 and 20 is 60 and LCM of 5 and 7 is 35.

A **simple solution** is to find all prime factors of both numbers, then find union of all factors present in both numbers. Finally return product of elements in union.

An **efficient solution ** is based on below formula for LCM of two numbers ‘a’ and ‘b’.

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

We have discussed function to find GCD of two numbers. Using GCD, we can find LCM.

Below is the implementation of above idea :

## C++

`// C++ program to find LCM of two numbers ` `#include <iostream> ` `using` `namespace` `std; ` `// Recursive function to return gcd of a and b ` `class` `gfg ` `{ ` ` ` `public` `: ` `int` `gcd(` `int` `a, ` `int` `b){ ` ` ` `if` `(a == 0) ` ` ` `return` `b; ` ` ` `return` `gcd(b % a, a); ` ` ` `} ` ` ` ` ` `// Function to return LCM of two numbers ` ` ` `int` `lcm(` `int` `a, ` `int` `b) ` ` ` `{ ` ` ` `return` `(a*b)/gcd(a, b); ` ` ` `} ` `} ; ` `// Driver program to test above function ` `int` `main() ` `{ ` ` ` `gfg g; ` ` ` `int` `a = 15, b = 20; ` ` ` `cout<<` `"LCM of "` `<<a<<` `" and "` `<<b<<` `" is "` `<<g.lcm(a, b); ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

## C

`// C program to find LCM of two numbers ` `#include <stdio.h> ` ` ` `// Recursive function to return gcd of a and b ` `int` `gcd(` `int` `a, ` `int` `b) ` `{ ` ` ` `if` `(a == 0) ` ` ` `return` `b; ` ` ` `return` `gcd(b % a, a); ` `} ` ` ` `// Function to return LCM of two numbers ` `int` `lcm(` `int` `a, ` `int` `b) ` `{ ` ` ` `return` `(a*b)/gcd(a, b); ` `} ` ` ` `// Driver program to test above function ` `int` `main() ` `{ ` ` ` `int` `a = 15, b = 20; ` ` ` `printf` `(` `"LCM of %d and %d is %d "` `, a, b, lcm(a, b)); ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

## Java

`// Java program to find LCM of two numbers. ` `class` `Test ` `{ ` ` ` `// Recursive method to return gcd of a and b ` ` ` `static` `int` `gcd(` `int` `a, ` `int` `b) ` ` ` `{ ` ` ` `if` `(a == ` `0` `) ` ` ` `return` `b; ` ` ` `return` `gcd(b % a, a); ` ` ` `} ` ` ` ` ` `// method to return LCM of two numbers ` ` ` `static` `int` `lcm(` `int` `a, ` `int` `b) ` ` ` `{ ` ` ` `return` `(a*b)/gcd(a, b); ` ` ` `} ` ` ` ` ` `// Driver method ` ` ` `public` `static` `void` `main(String[] args) ` ` ` `{ ` ` ` `int` `a = ` `15` `, b = ` `20` `; ` ` ` `System.out.println(` `"LCM of "` `+ a +` `" and "` `+ b + ` `" is "` `+ lcm(a, b)); ` ` ` `} ` `} ` |

*chevron_right*

*filter_none*

## Python3

`# Python program to find LCM of two numbers ` ` ` `# Recursive function to return gcd of a and b ` `def` `gcd(a,b): ` ` ` `if` `a ` `=` `=` `0` `: ` ` ` `return` `b ` ` ` `return` `gcd(b ` `%` `a, a) ` ` ` `# Function to return LCM of two numbers ` `def` `lcm(a,b): ` ` ` `return` `(a` `*` `b) ` `/` `gcd(a,b) ` ` ` `# Driver program to test above function ` `a ` `=` `15` `b ` `=` `20` `print` `(` `'LCM of'` `, a, ` `'and'` `, b, ` `'is'` `, lcm(a, b)) ` ` ` `# This code is contributed by Danish Raza ` |

*chevron_right*

*filter_none*

## C#

`// C# program to find LCM ` `// of two numbers. ` `using` `System; ` `class` `GFG { ` ` ` ` ` `// Recursive method to ` ` ` `// return gcd of a and b ` ` ` `static` `int` `gcd(` `int` `a, ` `int` `b) ` ` ` `{ ` ` ` `if` `(a == 0) ` ` ` `return` `b; ` ` ` `return` `gcd(b % a, a); ` ` ` `} ` ` ` ` ` `// method to return ` ` ` `// LCM of two numbers ` ` ` `static` `int` `lcm(` `int` `a, ` `int` `b) ` ` ` `{ ` ` ` `return` `(a * b) / gcd(a, b); ` ` ` `} ` ` ` ` ` `// Driver method ` ` ` `public` `static` `void` `Main() ` ` ` `{ ` ` ` `int` `a = 15, b = 20; ` ` ` `Console.WriteLine(` `"LCM of "` `+ a + ` ` ` `" and "` `+ b + ` `" is "` `+ lcm(a, b)); ` ` ` `} ` `} ` ` ` `// This code is contributed by anuj_67. ` |

*chevron_right*

*filter_none*

## PHP

`<?php ` `// PHP program to find LCM of two numbers ` ` ` `// Recursive function to ` `// return gcd of a and b ` `function` `gcd( ` `$a` `, ` `$b` `) ` `{ ` ` ` `if` `(` `$a` `== 0) ` ` ` `return` `$b` `; ` ` ` `return` `gcd(` `$b` `% ` `$a` `, ` `$a` `); ` `} ` ` ` `// Function to return LCM ` `// of two numbers ` `function` `lcm( ` `$a` `, ` `$b` `) ` `{ ` ` ` `return` `(` `$a` `* ` `$b` `) / gcd(` `$a` `, ` `$b` `); ` `} ` ` ` ` ` `// Driver Code ` ` ` `$a` `= 15; ` ` ` `$b` `= 20; ` ` ` `echo` `"LCM of "` `,` `$a` `, ` `" and "` ` ` `,` `$b` `, ` `" is "` `, lcm(` `$a` `, ` `$b` `); ` ` ` `// This code is contributed by anuj_67. ` `?> ` |

*chevron_right*

*filter_none*

Output:

LCM of 15 and 20 is 60

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above

## Recommended Posts:

- Program to find GCD or HCF of two numbers
- Program to find LCM of 2 numbers without using GCD
- Program to find sum of first n natural numbers
- Program to find sum of prime numbers between 1 to n
- Program to find first N Iccanobif Numbers
- Program to find LCM of two Fibonnaci Numbers
- C program to Find the Largest Number Among Three Numbers
- Program to find the percentage of difference between two numbers
- Program to find GCD of floating point numbers
- Program to find the common ratio of three numbers
- Program to find HCF (Highest Common Factor) of 2 Numbers
- Program to find the maximum difference between the index of any two different numbers
- Program to find GCD or HCF of two numbers using Middle School Procedure
- Program to find count of numbers having odd number of divisors in given range
- C++ program to find all numbers less than n, which are palindromic in base 10 and base 2.