1.0 KiB
1.0 KiB
id | challengeType | title | videoUrl | localeTitle |
---|---|---|---|---|
5900f4d01000cf542c50ffe2 | 5 | Problem 355: Maximal coprime subset | Problema 355: subconjunto de coprime máximo |
Description
Você está dado que Co (30) = 193 e Co (100) = 1356.
Encontre Co (200000).
Instructions
Tests
tests:
- text: <code>euler355()</code> deve retornar 1726545007.
testString: 'assert.strictEqual(euler355(), 1726545007, "<code>euler355()</code> should return 1726545007.");'
Challenge Seed
function euler355() {
// Good luck!
return true;
}
euler355();
Solution
// solution required