1.0 KiB
1.0 KiB
id | challengeType | title | videoUrl | localeTitle |
---|---|---|---|---|
5900f4ae1000cf542c50ffbf | 5 | Problem 320: Factorials divisible by a huge integer | Problema 320: Factorials divisíveis por um inteiro enorme |
Description
Seja S (u) = ∑N (i) para 10 ≤ i ≤ u.
S (1000) = 614538266565663.
Encontre S (1 000 000) mod 1018.
Instructions
Tests
tests:
- text: <code>euler320()</code> deve retornar 278157919195482660.
testString: 'assert.strictEqual(euler320(), 278157919195482660, "<code>euler320()</code> should return 278157919195482660.");'
Challenge Seed
function euler320() {
// Good luck!
return true;
}
euler320();
Solution
// solution required