1.1 KiB
1.1 KiB
id | challengeType | title |
---|---|---|
5900f4d61000cf542c50ffe9 | 5 | Problem 362: Squarefree factors |
Description
Let's call Fsf(n) the number of ways n can be factored into one or more squarefree factors larger than 1, so Fsf(54)=2.
Let S(n) be ∑Fsf(k) for k=2 to n.
S(100)=193.
Find S(10 000 000 000).
Instructions
Tests
tests:
- text: <code>euler362()</code> should return 457895958010.
testString: assert.strictEqual(euler362(), 457895958010, '<code>euler362()</code> should return 457895958010.');
Challenge Seed
function euler362() {
// Good luck!
return true;
}
euler362();
Solution
// solution required