GCD와 LCM

function greatestCommonDivisor(a, b) {return b ? greatestCommonDivisor(b, a % b) : Math.abs(a);}
function leastCommonMultipleOfTwo(a, b) {return (a * b) / greatestCommonDivisor(a, b);}
function gcdlcm(a, b) {
    return [greatestCommonDivisor(a, b),leastCommonMultipleOfTwo(a, b)];
}

 

function gcd(a, b) {
  if (a < b) {
    let temp = a;
    a = b;
    b = a;
  }

  while (b !== 0) {
    let n = a % b;
    a = b;
    b = n;
  }

  return a;
}