freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-7-10001st-prime.md

46 lines
697 B
Markdown
Raw Blame History

This file contains ambiguous Unicode characters!

This file contains ambiguous Unicode characters that may be confused with others in your current locale. If your use case is intentional and legitimate, you can safely ignore this warning. Use the Escape button to highlight these characters.

---
id: 5900f3731000cf542c50fe86
title: 问题710001个素数
challengeType: 5
videoUrl: ''
---
# --description--
通过列出前六个素数2,3,5,7,11和13我们可以看到第6个素数是13.第`n`个素数是多少?
# --hints--
`nthPrime(6)`应该返回13。
```js
assert.strictEqual(nthPrime(6), 13);
```
`nthPrime(10)`应该返回29。
```js
assert.strictEqual(nthPrime(10), 29);
```
`nthPrime(100)`应该返回541。
```js
assert.strictEqual(nthPrime(100), 541);
```
`nthPrime(1000)`应该返回7919。
```js
assert.strictEqual(nthPrime(1000), 7919);
```
`nthPrime(10001)`应该返回104743。
```js
assert.strictEqual(nthPrime(10001), 104743);
```
# --solutions--