1.1 KiB
1.1 KiB
id | challengeType | title | videoUrl | localeTitle |
---|---|---|---|---|
5900f47b1000cf542c50ff8d | 5 | Problem 271: Modular Cubes, part 1 | Problema 271: Cubos modulares, parte 1 |
Description
Cuando n = 91, hay 8 valores posibles para x, a saber: 9, 16, 22, 29, 53, 74, 79, 81. Por lo tanto, S (91) = 9 + 16 + 22 + 29 + 53 + 74 + 79 + 81 = 363.
Encuentre S (13082761331670030).
Instructions
Tests
tests:
- text: <code>euler271()</code> debe devolver 4617456485273130000.
testString: 'assert.strictEqual(euler271(), 4617456485273130000, "<code>euler271()</code> should return 4617456485273130000.");'
Challenge Seed
function euler271() {
// Good luck!
return true;
}
euler271();
Solution
// solution required