Files
freeCodeCamp/curriculum/challenges/spanish/08-coding-interview-prep/project-euler/problem-383-divisibility-comparison-between-factorials.spanish.md

67 lines
1.0 KiB
Markdown
Raw Normal View History

---
id: 5
localeTitle: 5900f4ed1000cf542c50ffff
challengeType: 5
title: 'Problem 383: Divisibility comparison between factorials'
---
## Description
<section id='description'>
Sea f5 (n) el entero más grande x para el que 5x divide n.
Por ejemplo, f5 (625000) = 7.
Sea T5 (n) el número de enteros i que satisfacen f5 ((2 · i-1)!) &lt;2 · f5 (i!) Y 1 ≤ i ≤ n.
Se puede verificar que T5 (103) = 68 y T5 (109) = 2408210.
Encuentre T5 (1018).
</section>
## Instructions
<section id='instructions'>
</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();
```
</div>
</section>
## Solution
<section id='solution'>
```js
// solution required
```
</section>