10001st prime

Problem 7.js

var isPrime = function(number, primes) {
    
    // Is the number evenly divisible by any of the current primes?
    for(var i = 0; i < primes.length; i++)
    {
        if(number % primes[i] === 0)
        {
            // if we manage an even division the number isnt prime
            return false;
        }
    }
    
    // If no even division has been found the number is prime
    return true;
}

var findPrime = function(primeToFind) {
    
    var currentPrimes = [];
    var iterator = 2; //begins at 2, the first prime
    
    // loop until the desired prime has been found
    while(currentPrimes.length < primeToFind)
    {
        // test if the current number is prime
        if(isPrime(iterator, currentPrimes))
        {
            currentPrimes.push(iterator);
        }
        
        // advance the iterator
        iterator++;
    }
    
    return currentPrimes[primeToFind-1];
}

console.log(findPrime(10001));