compute the least common multiple using Euclidean algorithm
npm install lcmCompute the least common multiple using
Euclid's algorithm.
`` js`
var lcm = require('lcm');
var n = lcm(21, 6);
console.log(n);
*
`
42
` js`
var lcm = require('lcm')
Return the least common multiple of the integers a and b using Euclid's
algorithm.
With npm do:
`
npm install lcm
MIT