freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-10-summation-of-pri...

62 lines
1.4 KiB
Markdown
Raw Normal View History

---
id: 5900f3761000cf542c50fe89
challengeType: 5
title: 'Problem 10: Summation of primes'
videoUrl: ''
localeTitle: 问题10素数的总和
---
## Description
<section id="description">低于10的素数之和为2 + 3 + 5 + 7 = 17.求出n以下所有素数的总和。 </section>
## Instructions
<section id="instructions">
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>primeSummation(17)</code>应该返回41。
testString: 'assert.strictEqual(primeSummation(17), 41, "<code>primeSummation(17)</code> should return 41.");'
- text: <code>primeSummation(2001)</code>应该返回277050。
testString: 'assert.strictEqual(primeSummation(2001), 277050, "<code>primeSummation(2001)</code> should return 277050.");'
- text: <code>primeSummation(140759)</code>应该返回873608362。
testString: 'assert.strictEqual(primeSummation(140759), 873608362, "<code>primeSummation(140759)</code> should return 873608362.");'
- text: <code>primeSummation(2000000)</code>应返回142913828922。
testString: 'assert.strictEqual(primeSummation(2000000), 142913828922, "<code>primeSummation(2000000)</code> should return 142913828922.");'
```
</section>
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
```js
function primeSummation(n) {
// Good luck!
return true;
}
primeSummation(2000000);
```
</div>
</section>
## Solution
<section id='solution'>
```js
// solution required
```
</section>