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
662 B
Markdown
45 lines
662 B
Markdown
---
|
|
id: 5900f4ae1000cf542c50ffbf
|
|
title: 'Problem 320: Factorials divisible by a huge integer'
|
|
challengeType: 5
|
|
forumTopicId: 301977
|
|
dashedName: problem-320-factorials-divisible-by-a-huge-integer
|
|
---
|
|
|
|
# --description--
|
|
|
|
Let N(i) be the smallest integer n such that n! is divisible by (i!)1234567890
|
|
|
|
Let S(u)=∑N(i) for 10 ≤ i ≤ u.
|
|
|
|
S(1000)=614538266565663.
|
|
|
|
Find S(1 000 000) mod 1018.
|
|
|
|
# --hints--
|
|
|
|
`euler320()` should return 278157919195482660.
|
|
|
|
```js
|
|
assert.strictEqual(euler320(), 278157919195482660);
|
|
```
|
|
|
|
# --seed--
|
|
|
|
## --seed-contents--
|
|
|
|
```js
|
|
function euler320() {
|
|
|
|
return true;
|
|
}
|
|
|
|
euler320();
|
|
```
|
|
|
|
# --solutions--
|
|
|
|
```js
|
|
// solution required
|
|
```
|