Intermediate Algorithm Scripting: Smallest Common Multiple

Intermediate Algorithm Scripting: Smallest Common Multiple.js

function smallestCommons(arr) {
  let numbers = arr.sort((a, b)=>a-b);

  for(let i = numbers[0]; i <= numbers[1]; i++){
    numbers.push(i);
  }

  return numbers.reduce((a, b) => {
    return lcm(a, b); 
  });

}

function gcd (a, b) {
  return (a % b === 0) ? b : gcd(b, a%b);
}

function lcm (a, b) {
  return (a * b) / gcd(a, b); 
}

smallestCommons([1,5]);