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.
- Game Theory (Normal-form Game) | Set 5 (Dominance Property-Mixed Strategy)
- Game Theory (Normal-form Game) | Set 4 (Dominance Property-Pure Strategy)
- Count of N digit Numbers having no pair of equal consecutive Digits
- Smallest String consisting of a String S exactly K times as a Substring
- Minimum Count of Bit flips required to make a Binary String Palindromic
- Check if an Array can be Sorted by picking only the corner Array elements
- Count of Binary Strings of length N such that frequency of 1's exceeds frequency of 0's
- Sort an Array of Version Numbers
- Minimum Sum of Euclidean Distances to all given Points
- Median of difference of all pairs from an Array
- Maximize the last Array element as per the given conditions
- Find the point on X-axis from given N points having least Sum of Distances from all other points
- Split N into two integers whose addition to A and B makes them equal