What is LCM? | Maths Explanation for C++ Kids
Akin to finding H.C.F., L.C.M. is commonly found by repeated factorization.
Only this time, the factors do not have to be common amongst the set of numbers.
If we have the set of numbers 8, 12 and
18 for example, their L.C.M. is found thus:
Hence, L.C.M. of 8, 12 and 18 = 2 X 2 X 2 x 3 x 3 = 72
Step-by-Step Guide to L.C.M. by Factorisation in C++
We shall follow the steps below in writing our C++ LCM code.
Step 1:
Do a numerical reverse sort on the (resulting) set so its first member
is the largest in the set.
Step 2:
Starting with 2, iteratively check through the set
of numbers for individual factors.
Step 3:
For each individual factor, divide affected member(s) of the number
set by the factor.
Step 4:
Repeat the above steps recursively until there are no more
individual factors.
Create a new C++ class file;
Call it LCM.
Type out the adjoining C++ code for finding Lowest Common Multiple (L.C.M.).
So! C++ Fun Practice Exercise - Find LCM
As a fun practice exercise, feel free to try out your own numbers,
and see how the C++ code finds the LCM of those numbers.