1.2 KiB
1.2 KiB
id | challengeType | title | videoUrl | localeTitle |
---|---|---|---|---|
5900f48d1000cf542c50ff9f | 5 | Problem 288: An enormous factorial | Problema 288: un enorme factorial. |
Description
S0 = 290797 Sn + 1 = Sn2 mod 50515093 Tn = Sn mod 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).
Se le da ese NF (3,10000) mod 320 = 624955285.
Encuentra NF (61,107) mod 6110
Instructions
Tests
tests:
- text: <code>euler288()</code> debe devolver 605857431263982000.
testString: 'assert.strictEqual(euler288(), 605857431263982000, "<code>euler288()</code> should return 605857431263982000.");'
Challenge Seed
function euler288() {
// Good luck!
return true;
}
euler288();
Solution
// solution required