freeCodeCamp/curriculum/challenges/spanish/08-coding-interview-prep/project-euler/problem-288-an-enormous-factorial.spanish.md

---
id: 5900f48d1000cf542c50ff9f
challengeType: 5
title: 'Problem 288: An enormous factorial'
videoUrl: ''
localeTitle: 'Problema 288: un enorme factorial.'
---

## Description
<section id="description"> Para cualquier primo p, el número N (p, q) se define por N (p, q) = ∑n = 0 a q Tn * pn con Tn generado por el siguiente generador de números aleatorios: <p> S0 = 290797 Sn + 1 = Sn2 mod 50515093 Tn = Sn mod p </p><p> Sea Nfac (p, q) el factorial de N (p, q). Sea NF (p, q) el número de factores p en Nfac (p, q). </p><p> Se le da ese NF (3,10000) mod 320 = 624955285. </p><p> Encuentra NF (61,107) mod 6110 </p></section>

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

## Tests
<section id='tests'>

```yml
tests:
  - text: <code>euler288()</code> debe devolver 605857431263982000.
    testString: 'assert.strictEqual(euler288(), 605857431263982000, "<code>euler288()</code> should return 605857431263982000.");'

```

</section>

## Challenge Seed
<section id='challengeSeed'>

<div id='js-seed'>

```js
function euler288() {
  // Good luck!
  return true;
}

euler288();

```

</div>



</section>

## Solution
<section id='solution'>

```js
// solution required
```
</section>