2018-10-08 17:51:51 +00:00
---
2018-10-10 20:20:40 +00:00
id: 5900f47b1000cf542c50ff8d
2018-10-08 17:51:51 +00:00
challengeType: 5
title: 'Problem 271: Modular Cubes, part 1'
2018-10-10 20:20:40 +00:00
videoUrl: ''
localeTitle: 'Problema 271: Cubos modulares, parte 1'
2018-10-08 17:51:51 +00:00
---
## Description
2018-10-10 20:20:40 +00:00
< section id = "description" > Para un número positivo n, defina S (n) como la suma de los enteros x, para lo cual 1 < p > 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. < / p > < p > Encuentre S (13082761331670030). < / p > < / section >
2018-10-08 17:51:51 +00:00
## Instructions
2018-10-10 20:20:40 +00:00
< section id = "instructions" >
2018-10-08 17:51:51 +00:00
< / section >
## Tests
< section id = 'tests' >
```yml
tests:
- text: < code > euler271()</ code > debe devolver 4617456485273130000.
testString: 'assert.strictEqual(euler271(), 4617456485273130000, "< code > euler271()< / code > should return 4617456485273130000.");'
```
< / section >
## Challenge Seed
< section id = 'challengeSeed' >
< div id = 'js-seed' >
```js
function euler271() {
// Good luck!
return true;
}
euler271();
2018-10-10 20:20:40 +00:00
2018-10-08 17:51:51 +00:00
```
< / div >
< / section >
## Solution
< section id = 'solution' >
```js
// solution required
```
< / section >