ee1e8abd87
* feat(tools): add seed/solution restore script * chore(curriculum): remove empty sections' markers * chore(curriculum): add seed + solution to Chinese * chore: remove old formatter * fix: update getChallenges parse translated challenges separately, without reference to the source * chore(curriculum): add dashedName to English * chore(curriculum): add dashedName to Chinese * refactor: remove unused challenge property 'name' * fix: relax dashedName requirement * fix: stray tag Remove stray `pre` tag from challenge file. Signed-off-by: nhcarrigan <nhcarrigan@gmail.com> Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
1.3 KiB
1.3 KiB
id, title, challengeType, forumTopicId, dashedName
| id | title | challengeType | forumTopicId | dashedName |
|---|---|---|---|---|
| 5900f3731000cf542c50fe86 | Problem 7: 10001st prime | 5 | 302182 | 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?
--hints--
nthPrime(6) should return a number.
assert(typeof nthPrime(6) === 'number');
nthPrime(6) should return 13.
assert.strictEqual(nthPrime(6), 13);
nthPrime(10) should return 29.
assert.strictEqual(nthPrime(10), 29);
nthPrime(100) should return 541.
assert.strictEqual(nthPrime(100), 541);
nthPrime(1000) should return 7919.
assert.strictEqual(nthPrime(1000), 7919);
nthPrime(10001) should return 104743.
assert.strictEqual(nthPrime(10001), 104743);
--seed--
--seed-contents--
function nthPrime(n) {
return true;
}
nthPrime(10001);
--solutions--
const nthPrime = n => {
let pN = 2;
let step = 0;
while (step < n) {
let isPrime = true;
let rootN = Math.sqrt(pN);
for (let i = 2; i <= rootN; i++) {
if (!(pN % i)) {
isPrime = false;
break;
}
}
isPrime ? step++ : '';
pN++;
}
return pN - 1;
}