freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-381-prime-k-factori...

56 lines
1.1 KiB
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: 5900f4ea1000cf542c50fffc
challengeType: 5
title: 'Problem 381: (prime-k) factorial'
videoUrl: ''
localeTitle: 问题381prime-k阶乘
---
## Description
<section id="description">对于素数p令Sp=Σpkmodp1≤k≤5。 <p>例如如果p = 77-1 +7-2 +7-3 +7-4 +7-5 = 6 + 5 + 4 + 3 + 2 = 720 + 120 + 24 + 6 + 2 = 872.当872 mod7= 4时S7= 4。 </p><p>对于5≤p&lt;100可以证实ΣSp= 480。 </p><p>求ΣSp为5≤p&lt;108。 </p></section>
## Instructions
<section id="instructions">
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler381()</code>应该返回139602943319822。
testString: 'assert.strictEqual(euler381(), 139602943319822, "<code>euler381()</code> should return 139602943319822.");'
```
</section>
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
```js
function euler381() {
// Good luck!
return true;
}
euler381();
```
</div>
</section>
## Solution
<section id='solution'>
```js
// solution required
```
</section>