LCM es6 code added

Author: me-shaon

Number Theory/LCM/es6/gcd.js

@@ -0,0 +1,5 @@
+// A recursive approach to GCD Implementation
+// Details of this code can be found at 'GCD' Directory
+const gcd = (a, b) => (b === 0) ? a : gcd(b, a%b);
+
+module.exports = gcd

Number Theory/LCM/es6/lcm.js

@@ -0,0 +1,12 @@
+/* Least Commond Multiple (LCM) Finding in JavaScript */
+const gcd = require('./gcd');
+
+/*
+  The basic formula of Calculating LCM of 'a' and 'b' is:
+    LCM(a,b) = (a * b)/gcd(a,b)
+  As multiplying (a*b) can be a large number for some 'a' and 'b',
+  we are dividing one of the numbers, 'a' here,
+  by the gcd(a,b) before multiplication and reducing the possibility
+  of 'integer overflow'
+*/
+module.exports.lcm = (a, b) => ((a / gcd(a,b)) * b);

Number Theory/LCM/es6/test.js

@@ -0,0 +1,5 @@
+const { lcm } = require('./lcm');
+
+/************ Testing LCM ***************/
+console.log(lcm(5, 10));
+console.log(lcm(14, 35));

Number Theory/LCM/lcm.js

@@ -1,5 +1,13 @@
 /* Least Commond Multiple (LCM) Finding in JavaScript */
 
+/*
+  The basic formula of Calculating LCM of 'a' and 'b' is:
+    LCM(a,b) = (a * b)/gcd(a,b)
+  As multiplying (a*b) can be a large number for some 'a' and 'b',
+  we are dividing one of the numbers, 'a' here,
+  by the gcd(a,b) before multiplication and reducing the possibility
+  of 'integer overflow'
+*/
 function lcm(a, b) {
     return (a / gcd(a,b)) * b;
 }