ee1e8abd87
* feat(tools): add seed/solution restore script * chore(curriculum): remove empty sections' markers * chore(curriculum): add seed + solution to Chinese * chore: remove old formatter * fix: update getChallenges parse translated challenges separately, without reference to the source * chore(curriculum): add dashedName to English * chore(curriculum): add dashedName to Chinese * refactor: remove unused challenge property 'name' * fix: relax dashedName requirement * fix: stray tag Remove stray `pre` tag from challenge file. Signed-off-by: nhcarrigan <nhcarrigan@gmail.com> Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
45 lines
788 B
Markdown
45 lines
788 B
Markdown
---
|
||
id: 5900f4ea1000cf542c50fffc
|
||
title: 问题381：（prime-k）阶乘
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-381-prime-k-factorial
|
||
---
|
||
|
||
# --description--
|
||
|
||
对于素数p，令S（p）=（Σ（pk）！）mod（p）1≤k≤5。
|
||
|
||
例如，如果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。
|
||
|
||
对于5≤p<100，可以证实ΣS（p）= 480。
|
||
|
||
求ΣS（p）为5≤p<108。
|
||
|
||
# --hints--
|
||
|
||
`euler381()`应该返回139602943319822。
|
||
|
||
```js
|
||
assert.strictEqual(euler381(), 139602943319822);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler381() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler381();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|