2018-10-08 17:51:51 +00:00
---
2018-10-10 20:20:40 +00:00
id: 5900f4ae1000cf542c50ffbf
2018-10-08 17:51:51 +00:00
challengeType: 5
title: 'Problem 320: Factorials divisible by a huge integer'
2018-10-10 20:20:40 +00:00
videoUrl: ''
localeTitle: 'Problema 320: Factoriales divisibles por un entero enorme'
2018-10-08 17:51:51 +00:00
---
## Description
2018-10-10 20:20:40 +00:00
< section id = "description" > Sea N (i) el entero más pequeño n tal que n! es divisible por (i!) 1234567890 < p > Sea S (u) = ∑N (i) para 10 ≤ i ≤ u. < / p > < p > S (1000) = 614538266565663. < / p > < p > Encontrar S (1 000 000) mod 1018. < / p > < / section >
2018-10-08 17:51:51 +00:00
## Instructions
2018-10-10 20:20:40 +00:00
< section id = "instructions" >
2018-10-08 17:51:51 +00:00
< / section >
## Tests
< section id = 'tests' >
```yml
tests:
- text: < code > euler320()</ code > debe devolver 278157919195482660.
testString: 'assert.strictEqual(euler320(), 278157919195482660, "< code > euler320()< / code > should return 278157919195482660.");'
```
< / section >
## Challenge Seed
< section id = 'challengeSeed' >
< div id = 'js-seed' >
```js
function euler320() {
// Good luck!
return true;
}
euler320();
2018-10-10 20:20:40 +00:00
2018-10-08 17:51:51 +00:00
```
< / div >
< / section >
## Solution
< section id = 'solution' >
```js
// solution required
```
< / section >