Many times while we do programming, we need to calculate the Least Common Multiple (LCM) between two numbers. We have already discussed how to find LCM in this post.
In place of defining and then using a function for calculating lcm , we can simply use an inbuilt function of boost library of C++ , boost::math::lcm ().
For using this function , we have to declare a header file <boost/math/common_factor.hpp>.
boost::math::lcm (m,n) Parameters: m, n Return Value: 0 if either m or n are zero, else lcm of mod(m) and mod(n).
LCM(10,20) = 20
- The function will calculate the lcm after taking the modulus of both the numbers, so in case if any of the number being negative, it will be converted to its modulus and then LCM is calculated.
- In case if any of the number being a non-integer data type , then this function will throw an error.
// CPP program to illustrate illegal
// behaviour of boost::math::lcm function of C++
"LCM(1.0,20) = "
This code will throw an error, as one of the argument of the function is a double type, so this code will not work.
- In C++17, a new STL function for calculating LCM of two numbers, std::lcm(), has been introduced, which can be used on any compiler supporting C++17 features.
- std::gcd | C++ inbuilt function for finding GCD
- Calculating Factorials using Stirling Approximation
- Calculating n-th real root using binary search
- Function Overloading vs Function Overriding in C++
- What happens when a virtual function is called inside a non-virtual function in C++
- div() function in C++
- fma() function in C++
- log() function in C++
- exp() function C++
- map lower_bound() function in C++ STL
- scalbln() function in C++ STL
- map count() function in C++ STL
- unordered_multiset end() function in C++ STL
- map emplace_hint() function in C++ STL
- map find() function in C++ STL
This article is contributed by Mrigendra Singh. 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.