1.7 KiB
1.7 KiB
id | challengeType | title |
---|---|---|
5900f3731000cf542c50fe86 | 5 | Problem 7: 10001st prime |
Description
n
th prime number?
Instructions
Tests
tests:
- text: <code>nthPrime(6)</code> should return 13.
testString: assert.strictEqual(nthPrime(6), 13, '<code>nthPrime(6)</code> should return 13.');
- text: <code>nthPrime(10)</code> should return 29.
testString: assert.strictEqual(nthPrime(10), 29, '<code>nthPrime(10)</code> should return 29.');
- text: <code>nthPrime(100)</code> should return 541.
testString: assert.strictEqual(nthPrime(100), 541, '<code>nthPrime(100)</code> should return 541.');
- text: <code>nthPrime(1000)</code> should return 7919.
testString: assert.strictEqual(nthPrime(1000), 7919, '<code>nthPrime(1000)</code> should return 7919.');
- text: <code>nthPrime(10001)</code> should return 104743.
testString: assert.strictEqual(nthPrime(10001), 104743, '<code>nthPrime(10001)</code> should return 104743.');
Challenge Seed
function nthPrime(n) {
// Good luck!
return true;
}
nthPrime(10001);
Solution
const nthPrime = (number)=>{
let pN = 2;
let step = 0;
while (step<number) {
let isPrime = true;
for(let i = 2;i<pN;i++){
if(!(pN%i)){
isPrime = false;
break;
}
}
isPrime ? step++ : '';
pN++;
}
return pN-1;
}