(n)
| 12 | |
| 13 | // Return n-th prime |
| 14 | function prime(n) { |
| 15 | if (n < 1) { |
| 16 | throw Error("n too small: " + n); |
| 17 | } |
| 18 | let count = 0; |
| 19 | let result = 1; |
| 20 | while(count < n) { |
| 21 | result++; |
| 22 | if (isPrime(result)) { |
| 23 | count++; |
| 24 | } |
| 25 | } |
| 26 | return result; |
| 27 | } |
| 28 | |
| 29 | console.log("your prime is ", prime(100000)); |
| 30 |