909 B
909 B
id | challengeType | title |
---|---|---|
5900f4ae1000cf542c50ffbf | 5 | Problem 320: Factorials divisible by a huge integer |
Description
Let S(u)=∑N(i) for 10 ≤ i ≤ u.
S(1000)=614538266565663.
Find S(1 000 000) mod 1018.
Instructions
Tests
tests:
- text: <code>euler320()</code> should return 278157919195482660.
testString: assert.strictEqual(euler320(), 278157919195482660, '<code>euler320()</code> should return 278157919195482660.');
Challenge Seed
function euler320() {
// Good luck!
return true;
}
euler320();
Solution
// solution required