Lowest Common Multiple in JavaScript

Finding L.C.M. in JavaScript

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 JavaScript 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 2 new files; On Notepad++: File, New.
Call them LCM.html and LCM.js.
Type out the adjoining JavaScript code for finding Lowest Common Multiple (L.C.M.).

JavaScript code for LCM.html

<!DOCTYPE html>

<html lang="en">
    <head>
        <meta charset="utf-8" />
        <title>Find H.C.F.</title>
        <script src="LCM.js"></script>
    </head>
    <body>
        <h4>Lowest Common Multiple of a Set of Numbers.</h4>
        <div id="myLCM"></div>

        <script>/*
         * 'set_of_numbers' holds the numbers whose LCM we are trying to find.
         * Add as many of these numbers as you wish by extending the array.
         */
            var set_of_numbers = [];
            set_of_numbers[0] = 4;
            set_of_numbers[1] = 5;
            set_of_numbers[2] = 6;

            var result = getLCM(set_of_numbers); // call to our function

            document.getElementById("myLCM").innerHTML = "The L.C.M. of " +
                    set_of_numbers.join(", ") + " is: " + result;
        </script>
    </body>
</html>

LCM.js

I have a better version / See other versions.