Finding LCM using GCD is explained here but here the task is to find LCM without first calculating GCD.
Input: 7, 5 Output: 35 Input: 2, 6 Output: 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.
LCM of 5 and 7 is 35
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Sum of LCM(1, n), LCM(2, n), LCM(3, n), ... , LCM(n, n)
- Finding LCM of more than two (or array) numbers without using GCD
- Given GCD G and LCM L, find number of possible pairs (a, b)
- Find any pair with given GCD and LCM
- Find the GCD of LCM of all unique pairs in an Array
- Find the ratio of LCM to GCD of a given Array
- Minimum replacement of pairs by their LCM required to reduce given array to its LCM
- GCD, LCM and Distributive Property
- Levelwise Alternating GCD and LCM of nodes in Segment Tree
- Minimum LCM and GCD possible among all possible sub-arrays
- Print any pair of integers with sum of GCD and LCM equals to N
- Count of all possible pairs having sum of LCM and GCD equal to N
- Program to find GCD or HCF of two numbers using Middle School Procedure
- Program to find LCM of two numbers
- Program to find LCM of two Fibonnaci Numbers
- Program to find the LCM of two prime numbers
- Pair of integers having least GCD among all given pairs having GCD exceeding K
- Program to find GCD of floating point numbers
- Program to find GCD or HCF of two numbers
- Maximum sum of distinct numbers such that LCM of these numbers is N
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.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.