prime.js

function firstNPrime(n){
  var i = 1, j = 0, k = 0;
  var result = []
  while(++i && result.length != n){
    k = i
    j = 0
    while(--k){
      if(i % k == 0) j++
    }
    if(j == 1)result.push(i)
  }
  return result
}