gistfile1.js

function hamming (n) {
  // TODO: Program me
  
  var hammedNumbers = [];
  var startIndex = 1;
  
  while(hammedNumbers.length < n)
  {
    var primeFactors = calcPrimeFactors(startIndex);
    var largestPrime = primeFactors[primeFactors.length - 1];
    if(largestPrime == 5)
    {
      hammedNumbers.push(largestPrime);
    }
    
    startIndex++;
  }
  
  return hammedNumbers[hammedNumbers.length - 1];
}

function calcPrimeFactors(n)
{
  var factors = [];
  var d = 2;
  
  while(n > 1)
  {
    while(n % 2 == 0)
    {
      factors.push(n);
      n /= d;
    }
  }
  
  return factors;
}