1.0 KiB
1.0 KiB
id | challengeType | title | videoUrl | localeTitle |
---|---|---|---|---|
5900f52c1000cf542c51003f | 5 | Problem 448: Average least common multiple | Problema 448: Múltiplo menos comum comum |
Description
Seja S (n) = ∑A (k) para 1≤k≤n. S (100) = 122726.
Encontre S (99999999019) mod 999999017.
Instructions
Tests
tests:
- text: ''
testString: 'assert.strictEqual(euler448(), 106467648, "<code>euler448()</code> should return 106467648.");'
Challenge Seed
function euler448() {
// Good luck!
return true;
}
euler448();
Solution
// solution required