2018-10-08 17:51:51 +00:00
---
2018-10-10 20:20:40 +00:00
id: 5900f4ed1000cf542c50ffff
2018-10-08 17:51:51 +00:00
challengeType: 5
title: 'Problem 383: Divisibility comparison between factorials'
2018-10-10 20:20:40 +00:00
videoUrl: ''
localeTitle: 'Problema 383: comparación de divisibilidad entre factoriales'
2018-10-08 17:51:51 +00:00
---
## Description
2018-10-10 20:20:40 +00:00
< section id = "description" > Sea f5 (n) el mayor entero x para el cual 5x divide n. Por ejemplo, f5 (625000) = 7. < p > Sea T5 (n) el número de enteros i que satisfacen f5 ((2 · i-1)!) < 2 · f5 (i!) Y 1 ≤ i ≤ n. Se puede verificar que T5 (103) = 68 y T5 (109) = 2408210. < / p > < p > Encuentra T5 (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 > euler383()</ code > debe devolver 22173624649806.
testString: 'assert.strictEqual(euler383(), 22173624649806, "< code > euler383()< / code > should return 22173624649806.");'
```
< / section >
## Challenge Seed
< section id = 'challengeSeed' >
< div id = 'js-seed' >
```js
function euler383() {
// Good luck!
return true;
}
euler383();
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 >