68 lines
1.0 KiB
Markdown
68 lines
1.0 KiB
Markdown
|
---
|
||
|
|
id: 5
|
||
|
|
localeTitle: 5900f4ea1000cf542c50fffc
|
||
|
|
challengeType: 5
|
||
|
|
title: 'Problem 381: (prime-k) factorial'
|
||
|
|
---
|
||
|
|
|
||
|
|
## Description
|
||
|
|
<section id='description'>
|
||
|
|
Para un primo p, deje que S (p) = (∑ (pk)!) Mod (p) para 1 ≤ k ≤ 5.
|
||
|
|
|
||
|
|
|
||
|
|
Por ejemplo, si p = 7,
|
||
|
|
(7-1)! + (7-2)! + (7-3)! + (7-4)! + (7-5)! = 6! + 5! + 4! + 3! + 2! = 720 + 120 + 24 + 6 + 2 = 872.
|
||
|
|
Como 872 mod (7) = 4, S (7) = 4.
|
||
|
|
|
||
|
|
|
||
|
|
Se puede verificar que ∑S (p) = 480 para 5 ≤ p < 100.
|
||
|
|
|
||
|
|
|
||
|
|
Encuentra ∑S (p) para 5 ≤ p <108.
|
||
|
|
</section>
|
||
|
|
|
||
|
|
## Instructions
|
||
|
|
<section id='instructions'>
|
||
|
|
|
||
|
|
</section>
|
||
|
|
|
||
|
|
## Tests
|
||
|
|
<section id='tests'>
|
||
|
|
|
||
|
|
```yml
|
||
|
|
tests:
|
||
|
|
- text: <code>euler381()</code> debe devolver 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>
|