---
id: 5900f3731000cf542c50fe86
challengeType: 5
title: 'Problem 7: 10001st prime'
videoUrl: ''
localeTitle: ''
---

## Description
<section id="description"> Ao listar os seis primeiros números primos: 2, 3, 5, 7, 11 e 13, podemos ver que o sexto primo é 13. Qual é o número <code>n</code> ésimo? </section>

## Instructions
<section id="instructions">
</section>

## Tests
<section id='tests'>

```yml
tests:
  - text: <code>nthPrime(6)</code> deve retornar 13.
    testString: 'assert.strictEqual(nthPrime(6), 13, "<code>nthPrime(6)</code> should return 13.");'
  - text: <code>nthPrime(10)</code> deve retornar 29.
    testString: 'assert.strictEqual(nthPrime(10), 29, "<code>nthPrime(10)</code> should return 29.");'
  - text: ''
    testString: 'assert.strictEqual(nthPrime(100), 541, "<code>nthPrime(100)</code> should return 541.");'
  - text: ''
    testString: 'assert.strictEqual(nthPrime(1000), 7919, "<code>nthPrime(1000)</code> should return 7919.");'
  - text: <code>nthPrime(10001)</code> deve retornar 104743.
    testString: 'assert.strictEqual(nthPrime(10001), 104743, "<code>nthPrime(10001)</code> should return 104743.");'

```

</section>

## Challenge Seed
<section id='challengeSeed'>

<div id='js-seed'>

```js
function nthPrime(n) {
  // Good luck!
  return true;
}

nthPrime(10001);

```

</div>



</section>

## Solution
<section id='solution'>

```js
// solution required
```
</section>