Input: x = 15, y = 20, z = 100 Output: 60 Input: x = 30, y = 40, z = 400 Output: 120
One way to solve it is by finding GCD(x, y), and using it we find LCM(x, y). Similarly, we find LCM(x, z) and then we finally find the GCD of the obtained results.
An efficient approach can be done by the fact that the following version of distributivity holds true:
GCD(LCM (x, y), LCM (x, z)) = LCM(x, GCD(y, z))
For example, GCD(LCM(3, 4), LCM(3, 10)) = LCM(3, GCD(4, 10)) = LCM(3, 2) = 6
This reduces our work to compute the given problem statement.
As a side note, vice versa is also true, i.e., gcd(x, lcm(y, z)) = lcm(gcd(x, y), gcd(x, z)
This article is contributed by Mazhar Imam Khan. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
- Check if the sum of digits of number is divisible by all of its digits
- Program for Mobius Function | Set 2
- Make the list non-decreasing by changing only one digit of the elements
- Maximum items that can be bought with the given type of coins
- Count occurrences of a prime number in the prime factorization of every element from the given range
- Check if the number is valid when flipped upside down
- Find the count of subsequences where each element is divisible by K
- Count of numbers below N whose sum of prime divisors is K
- Queries for the smallest and the largest prime number of given digit
- Find two co-prime integers such that the first divides A and the second divides B
- Find a Square Matrix such that sum of elements in every row and column is K
- Divide first N natural numbers into 3 equal sum subsets
- Count of distinct graphs that can be formed with N vertices