Bonfire: Smallest Common Multiple

by Luis Valle

JavaScript

function smallestCommons(arr) {
	arr.sort(function(a, b) {
    return a - b;
  });
  
  var myNums = [];
  
  for (var i=arr[0]; i < (arr[1] + 1); i++) {
  	if (i > 1) {
    	myNums.push(i);
    }  	
  }
  
  var leastCD = myNums[myNums.length -1] * myNums[myNums.length -2];
  //alert(leastCD);
  var ress = false;
  while (ress == false) {
  	leastCD = leastCD + myNums[myNums.length -1];
  	ress = isCommon(leastCD, myNums);
  }

  return leastCD;
}

function isCommon(commonD, commonArr) {
	var allCommon = true;
  for (var i=0; i < commonArr.length; i++) {
  	var remainder = (commonD % commonArr[i]) / 100;
  	if (remainder === 0) {
    	
    } else {
    	allCommon = false;
      break;
    }
  }
  
  return allCommon;
}


alert(smallestCommons([1, 13]));