http://www.freecodecamp.com/nirajkrz 's solution for Bonfire: Smallest Common Multiple

bonfire-smallest-common-multiple.js

// Bonfire: Smallest Common Multiple
// Author: @nirajkrz
// Challenge: http://www.freecodecamp.com/challenges/bonfire-smallest-common-multiple
// Learn to Code at Free Code Camp (www.freecodecamp.com)

function smallestCommons(arr) {
  arr.sort(function(a, b) {
    return b - a;
  });

  // Create new array and add all values from greater to smaller from the original array.
  var newArr = [];
  for (var i = arr[0]; i >= arr[1]; i--) {
    newArr.push(i);
  }
  
  // Variables needed declared outside the loops.
  var quot = 0;
  var loop = 1;
  var n;
  
  while (n !== newArr.length){
    quot = newArr[0] * loop * newArr[1];
    for (n = 2; n < newArr.length; n++) {
      if (quot % newArr[n] !== 0) {
        break;
      }
    }

    loop++;
  }
   return quot;
}


smallestCommons([1,5]);