Finding L.C.M. in Visual Basic (VB.Net)
Akin to 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
Simulating L.C.M. in Visual Basic (VB.Net) code
We shall follow the steps below in writing our 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 class file; Project, Add Class.
Call it findLCM.vb.
Optionally, create a new module file; Project, Add Module.
Call it FindLCMModule.vb.
Type out the adjoining Visual Basic (VB.Net) code for finding Lowest Common Multiple (L.C.M.)