56 lines
1.1 KiB
Markdown
56 lines
1.1 KiB
Markdown
|
---
|
|||
|
|
id: 5900f4ea1000cf542c50fffc
|
|||
|
|
challengeType: 5
|
|||
|
|
title: 'Problem 381: (prime-k) factorial'
|
|||
|
|
videoUrl: ''
|
|||
|
|
localeTitle: 问题381：（prime-k）阶乘
|
|||
|
|
---
|
|||
|
|
|
|||
|
|
## Description
|
|||
|
|
<section id="description">对于素数p，令S（p）=（Σ（pk）！）mod（p）1≤k≤5。 <p>例如，如果p = 7，（7-1）！ +（7-2）！ +（7-3）！ +（7-4）！ +（7-5）！ = 6！ + 5！ + 4！ + 3！ + 2！ = 720 + 120 + 24 + 6 + 2 = 872.当872 mod（7）= 4时，S（7）= 4。 </p><p>对于5≤p<100，可以证实ΣS（p）= 480。 </p><p>求ΣS（p）为5≤p<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>
|