freeCodeCamp/problem-7-10001st-prime.chinese.md at b99d78858be1d1ab1aae3417e00c38a458a72ae3

Files

Oliver Eyton-Williams 61460c8601 fix: insert blank line after ```

search and replace ```\n< with ```\n\n< to ensure there's an empty line
before closing tags

2020-08-16 04:45:20 +05:30

1.2 KiB

Raw Blame History

id, challengeType, title, videoUrl, localeTitle

id	challengeType	title	videoUrl	localeTitle
5900f3731000cf542c50fe86	5	Problem 7: 10001st prime		问题7：10001个素数

Description

通过列出前六个素数：2,3,5,7,11和13，我们可以看到第6个素数是13.第n个素数是多少？

Instructions

Tests

tests:
  - text: <code>nthPrime(6)</code>应该返回13。
    testString: assert.strictEqual(nthPrime(6), 13);
  - text: <code>nthPrime(10)</code>应该返回29。
    testString: assert.strictEqual(nthPrime(10), 29);
  - text: <code>nthPrime(100)</code>应该返回541。
    testString: assert.strictEqual(nthPrime(100), 541);
  - text: <code>nthPrime(1000)</code>应该返回7919。
    testString: assert.strictEqual(nthPrime(1000), 7919);
  - text: <code>nthPrime(10001)</code>应该返回104743。
    testString: assert.strictEqual(nthPrime(10001), 104743);

Challenge Seed

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

nthPrime(10001);

Solution

// solution required

/section>

1.2 KiB Raw Blame History Unescape Escape