Finds the Least Common Multiple for two numbers.

least-common-multiple-2-inputs.js

function getGreatestCommonDivisor(x, y) {
  while(x !== 0 && y !== 0) {
      if(x > y) {
          x %= y;
      } else {
          y %= x;
      }
  }
  return Math.max(x, y);
}

function getLeastCommonMultiple(x, y) {
  return x / getGreatestCommonDivisor(x, y) * y;
}

Sourced from John D Cook's answer to a StackOverflow question at:
http://stackoverflow.com/questions/3154454/what-is-the-most-efficient-way-to-calculate-the-least-common-multiple-of-two-int

Published:
01 July 2010

Accessed:
03 August 2016