Small js file to find the smallest Commons between 2 numbers

smallestCommons.js

function smallestCommons(arr) {
  arr.sort();
  var first = arr[0];
  var last = arr[1];
  var multiplier = 1;
  var bool = [];
  var multiple = 0;
  
  while(bool.length < last){
    bool = [];
    multiple = multiplier*last;
  
    for(j=first; j<=last;j++){
        if((multiple%j)===0){
          bool.push(true);
      }
      else {
        break;
      }
    }
    console.log("multiple= ",multiple,"bool.length = ",bool.length);
  multiplier++;
}
  return multiple;
  
}


smallestCommons([1,13]);