1.0 KiB
1.0 KiB
id | challengeType | title | forumTopicId |
---|---|---|---|
5900f4be1000cf542c50ffd0 | 5 | Problem 337: Totient Stairstep Sequences | 301995 |
Description
Find S(20 000 000) mod 108.
1 φ denotes Euler's totient function.
Instructions
Tests
tests:
- text: <code>euler337()</code> should return 85068035.
testString: assert.strictEqual(euler337(), 85068035);
Challenge Seed
function euler337() {
// Good luck!
return true;
}
euler337();
Solution
// solution required