935 B
935 B
id | challengeType | title | forumTopicId |
---|---|---|---|
5900f4e81000cf542c50fffa | 5 | Problem 379: Least common multiple count | 302041 |
Description
Let g be the summatory function of f, i.e.: g(n) = ∑ f(i) for 1 ≤ i ≤ n.
You are given that g(106) = 37429395.
Find g(1012).
Instructions
Tests
tests:
- text: <code>euler379()</code> should return 132314136838185.
testString: assert.strictEqual(euler379(), 132314136838185);
Challenge Seed
function euler379() {
return true;
}
euler379();
Solution
// solution required