--- id: 5900f3731000cf542c50fe86 challengeType: 5 title: 'Problem 7: 10001st prime' --- ## Description
By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13. What is the nth prime number?
## Instructions
## Tests
```yml tests: - text: nthPrime(6) should return 13. testString: 'assert.strictEqual(nthPrime(6), 13, "nthPrime(6) should return 13.");' - text: nthPrime(10) should return 29. testString: 'assert.strictEqual(nthPrime(10), 29, "nthPrime(10) should return 29.");' - text: nthPrime(100) should return 541. testString: 'assert.strictEqual(nthPrime(100), 541, "nthPrime(100) should return 541.");' - text: nthPrime(1000) should return 7919. testString: 'assert.strictEqual(nthPrime(1000), 7919, "nthPrime(1000) should return 7919.");' - text: nthPrime(10001) should return 104743. testString: 'assert.strictEqual(nthPrime(10001), 104743, "nthPrime(10001) should return 104743.");' ```
## Challenge Seed
```js function nthPrime(n) { // Good luck! return true; } nthPrime(10001); ```
## Solution
```js const nthPrime = (number)=>{ let pN = 2; let step = 0; while (step