# Program to find LCM of 2 numbers without using GCD

Finding LCM using GCD is explained here but here the task is to find LCM without first calculating GCD.

**Examples:**

Input:7, 5Output:35Input:2, 6Output:6

The approach is to start with the largest of the 2 numbers and keep incrementing the larger number by itself till smaller number perfectly divides the resultant.

## C++

`// C++ program to find LCM of 2 numbers ` `// without using GCD ` `#include <bits/stdc++.h> ` `using` `namespace` `std; ` ` ` `// Function to return LCM of two numbers ` `int` `findLCM(` `int` `a, ` `int` `b) ` `{ ` ` ` `int` `lar = max(a, b); ` ` ` `int` `small = min(a, b); ` ` ` `for` `(` `int` `i = lar; ; i += lar) { ` ` ` `if` `(i % small == 0) ` ` ` `return` `i; ` ` ` `} ` `} ` ` ` `// Driver program to test above function ` `int` `main() ` `{ ` ` ` `int` `a = 5, b = 7; ` ` ` `cout << ` `"LCM of "` `<< a << ` `" and "` ` ` `<< b << ` `" is "` `<< findLCM(a, b); ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

## Java

`// Java program to find LCM of 2 numbers ` `// without using GCD ` `import` `java.io.*; ` `import` `java.lang.*; ` ` ` `class` `GfG { ` ` ` ` ` `// Function to return LCM of two numbers ` ` ` `public` `static` `int` `findLCM(` `int` `a, ` `int` `b) ` ` ` `{ ` ` ` `int` `lar = Math.max(a, b); ` ` ` `int` `small = Math.min(a, b); ` ` ` `for` `(` `int` `i = lar; ; i += lar) { ` ` ` `if` `(i % small == ` `0` `) ` ` ` `return` `i; ` ` ` `} ` ` ` `} ` ` ` ` ` `// Driver program to test above function ` ` ` `public` `static` `void` `main(String [] argc) ` ` ` `{ ` ` ` `int` `a = ` `5` `, b = ` `7` `; ` ` ` `System.out.println( ` `"LCM of "` `+ a + ` `" and "` ` ` `+ b + ` `" is "` `+ findLCM(a, b)); ` ` ` ` ` `} ` `} ` ` ` `// This dose is contributed by Sagar Shukla. ` |

*chevron_right*

*filter_none*

## Python 3

`# Python 3 program to find ` `# LCM of 2 numbers without ` `# using GCD ` `import` `sys ` ` ` `# Function to return ` `# LCM of two numbers ` `def` `findLCM(a, b): ` ` ` ` ` `lar ` `=` `max` `(a, b) ` ` ` `small ` `=` `min` `(a, b) ` ` ` `i ` `=` `lar ` ` ` `while` `(` `1` `) : ` ` ` `if` `(i ` `%` `small ` `=` `=` `0` `): ` ` ` `return` `i ` ` ` `i ` `+` `=` `lar ` ` ` `# Driver Code ` `a ` `=` `5` `b ` `=` `7` `print` `(` `"LCM of "` `, a , ` `" and "` `, ` ` ` `b , ` `" is "` `, ` ` ` `findLCM(a, b), sep ` `=` `"") ` ` ` `# This code is contributed ` `# by Smitha ` |

*chevron_right*

*filter_none*

## C#

`// C# program to find ` `// LCM of 2 numbers ` `// without using GCD ` `using` `System; ` ` ` `class` `GfG ` `{ ` ` ` ` ` `// Function to return ` ` ` `// LCM of two numbers ` ` ` `public` `static` `int` `findLCM(` `int` `a, ` ` ` `int` `b) ` ` ` `{ ` ` ` `int` `lar = Math.Max(a, b); ` ` ` `int` `small = Math.Min(a, b); ` ` ` `for` `(` `int` `i = lar; ; i += lar) ` ` ` `{ ` ` ` `if` `(i % small == 0) ` ` ` `return` `i; ` ` ` `} ` ` ` `} ` ` ` ` ` `// Driver Code ` ` ` `public` `static` `void` `Main() ` ` ` `{ ` ` ` `int` `a = 5, b = 7; ` ` ` `Console.WriteLine(` `"LCM of "` `+ a + ` ` ` `" and "` `+ b + ` ` ` `" is "` `+ ` ` ` `findLCM(a, b)); ` ` ` ` ` `} ` `} ` ` ` `// This code is contributed by anuj_67. ` |

*chevron_right*

*filter_none*

## PHP

`<?php ` `// PHP program to find ` `// LCM of 2 numbers ` `// without using GCD ` ` ` `// Function to return ` `// LCM of two numbers ` `function` `findLCM(` `$a` `, ` `$b` `) ` `{ ` ` ` `$lar` `= max(` `$a` `, ` `$b` `); ` ` ` `$small` `= min(` `$a` `, ` `$b` `); ` ` ` `for` `(` `$i` `= ` `$lar` `; ; ` `$i` `+= ` `$lar` `) ` ` ` `{ ` ` ` `if` `(` `$i` `% ` `$small` `== 0) ` ` ` `return` `$i` `; ` ` ` `} ` `} ` ` ` `// Driver Code ` `$a` `= 5; ` `$b` `= 7; ` `echo` `"LCM of "` `, ` `$a` `, ` `" and "` `, ` ` ` `$b` `, ` `" is "` `, ` ` ` `findLCM(` `$a` `, ` `$b` `); ` ` ` `// This code is contributed ` `// by Smitha ` `?> ` |

*chevron_right*

*filter_none*

**Output:**

LCM of 5 and 7 is 35

## Recommended Posts:

- Program to find LCM of two numbers
- Program to find GCD or HCF of two numbers
- Program to find first N Iccanobif Numbers
- Program to find LCM of two Fibonnaci Numbers
- Program to find sum of first n natural numbers
- Program to find sum of prime numbers between 1 to n
- Program to find GCD of floating point numbers
- Program to find the common ratio of three numbers
- Program to find the percentage of difference between two numbers
- C program to Find the Largest Number Among Three 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 HCF (Highest Common Factor) of 2 Numbers
- 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.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.