---
id: 5900f4ed1000cf542c50ffff
challengeType: 5
title: 'Problem 383: Divisibility comparison between factorials'
videoUrl: ''
localeTitle: 'Problema 383: Comparação de Divisibilidade entre Factorials'
---

## Description
<section id="description"> Seja f5 (n) o maior inteiro x para o qual 5x divide n. Por exemplo, f5 (625000) = 7. <p> Seja T5 (n) o número de inteiros i que satisfazem f5 ((2 · i-1)!) &lt;2 · f5 (i!) E 1 ≤ i ≤ n. Pode ser verificado que T5 (103) = 68 e T5 (109) = 2408210. </p><p> Encontre o T5 (1018). </p></section>

## Instructions
<section id="instructions">
</section>

## Tests
<section id='tests'>

```yml
tests:
  - text: <code>euler383()</code> deve retornar 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>