2018-10-08 17:51:51 +00:00
---
2018-10-10 20:20:40 +00:00
id: 5900f47d1000cf542c50ff8f
2018-10-08 17:51:51 +00:00
challengeType: 5
title: 'Problem 272: Modular Cubes, part 2'
2018-10-10 20:20:40 +00:00
videoUrl: ''
localeTitle: 'Problema 272: Cubos modulares, parte 2'
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 C (n) como el número de los enteros x, para los cuales 1 < p > Cuando n = 91, hay 8 valores posibles para x, a saber: 9, 16, 22, 29, 53, 74, 79, 81. Por lo tanto, C (91) = 8. < / p > < p > Encuentre la suma de los números positivos n≤1011 para los que C (n) = 242. < / 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 > euler272()</ code > debe devolver 8495585919506151000.
testString: 'assert.strictEqual(euler272(), 8495585919506151000, "< code > euler272()< / code > should return 8495585919506151000.");'
```
< / section >
## Challenge Seed
< section id = 'challengeSeed' >
< div id = 'js-seed' >
```js
function euler272() {
// Good luck!
return true;
}
euler272();
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 >