56 lines
1.0 KiB
Markdown
56 lines
1.0 KiB
Markdown
---
|
|
id: 5900f4ae1000cf542c50ffbf
|
|
challengeType: 5
|
|
title: 'Problem 320: Factorials divisible by a huge integer'
|
|
videoUrl: ''
|
|
localeTitle: 'Problema 320: Factoriales divisibles por un entero enorme'
|
|
---
|
|
|
|
## Description
|
|
<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>
|
|
|
|
## Instructions
|
|
<section id="instructions">
|
|
</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();
|
|
|
|
```
|
|
|
|
</div>
|
|
|
|
|
|
|
|
</section>
|
|
|
|
## Solution
|
|
<section id='solution'>
|
|
|
|
```js
|
|
// solution required
|
|
```
|
|
</section>
|