lcm

Compute the least common multiple using Euclid's algorithm.

example

var lcm = require('lcm');
var n = lcm(21, 6);
console.log(n);

42

methods

var lcm = require('lcm')

lcm(a, b)

Return the least common multiple of the integers a and b using Euclid's algorithm.

install

With npm do:

npm install lcm

license

MIT