63 lines
1.3 KiB
Markdown
63 lines
1.3 KiB
Markdown
|
---
|
|||
|
|
id: 5900f3731000cf542c50fe86
|
|||
|
|
challengeType: 5
|
|||
|
|
title: 'Problem 7: 10001st prime'
|
|||
|
|
videoUrl: ''
|
|||
|
|
localeTitle: 'Задача 7: 10001st prime'
|
|||
|
|
---
|
|||
|
|
|
|||
|
|
## Description
|
|||
|
|
<section id="description"> Перечислив первые шесть простых чисел: 2, 3, 5, 7, 11 и 13, мы увидим, что 6-е число равно 13. Что такое <code>n</code> е простое число? </section>
|
|||
|
|
|
|||
|
|
## Instructions
|
|||
|
|
undefined
|
|||
|
|
|
|||
|
|
## Tests
|
|||
|
|
<section id='tests'>
|
|||
|
|
|
|||
|
|
```yml
|
|||
|
|
tests:
|
|||
|
|
- text: ''
|
|||
|
|
testString: 'assert.strictEqual(nthPrime(6), 13, "<code>nthPrime(6)</code> should return 13.");'
|
|||
|
|
- text: ''
|
|||
|
|
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: ''
|
|||
|
|
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>
|