1.2 KiB
1.2 KiB
id | challengeType | title | videoUrl | localeTitle |
---|---|---|---|---|
5900f4be1000cf542c50ffd0 | 5 | Problem 337: Totient Stairstep Sequences | Problema 337 totiente sequências Stairstep |
Description
Encontre S (20 000 000) mod 108.
1 φ denota a função totiente de Euler.
Instructions
Tests
tests:
- text: <code>euler337()</code> deve retornar 85068035.
testString: 'assert.strictEqual(euler337(), 85068035, "<code>euler337()</code> should return 85068035.");'
Challenge Seed
function euler337() {
// Good luck!
return true;
}
euler337();
Solution
// solution required