ContextQMD
Back to Freecodecamp

Problem 7: 10001st prime

curriculum/challenges/english/blocks/project-euler-problems-1-to-100/5900f3731000cf542c50fe86.md

latest1.1 KB
Original Source

--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.

js
assert.isNumber(nthPrime(6));

nthPrime(6) should return 13.

js
assert.strictEqual(nthPrime(6), 13);

nthPrime(10) should return 29.

js
assert.strictEqual(nthPrime(10), 29);

nthPrime(100) should return 541.

js
assert.strictEqual(nthPrime(100), 541);

nthPrime(1000) should return 7919.

js
assert.strictEqual(nthPrime(1000), 7919);

nthPrime(10001) should return 104743.

js
assert.strictEqual(nthPrime(10001), 104743);

--seed--

--seed-contents--

js
function nthPrime(n) {

  return true;
}

nthPrime(10001);

--solutions--

js
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;
}