Program to find the LCM of two prime numbers
Input: N = 3, M = 7
The least numbers greater than equals to 3 and 7 which is a multiple of 3 and 7 is 21.
Attention reader! Don’t stop learning now. Get hold of all the important mathematical concepts for competitive programming with the Essential Maths for CP Course at a student-friendly price. To complete your preparation from learning a language to DS Algo and many more, please refer Complete Interview Preparation Course.
Input: N = 5, M = 5
The least numbers greater than equals to 5 and 5 which is a multiple of 5 and 5 is 5.
Approach: As we know that product of two numbers equals to the product of their Greatest Common Divisor(GCD) and Least Common Multiple(LCM). So, the LCM of the two given prime numbers can be given by: .
Since the GCD two different prime numbers are 1, Therefore , and if the two given numbers are same then the LCM is the number itself.
Below is the implementation of the above approach:
Time Complexity: O(1)
Auxiliary Space: O(1)