---
id: 5900f47b1000cf542c50ff8d
challengeType: 5
title: 'Problem 271: Modular Cubes, part 1'
videoUrl: ''
localeTitle: 'Problema 271: Cubos Modulares, parte 1'
---

## Description
<section id="description"> Para um número positivo n, defina S (n) como a soma dos inteiros x, para os quais 1 <p> Quando n = 91, existem 8 valores possíveis para x, a saber: 9, 16, 22, 29, 53, 74, 79, 81. Assim, S (91) = 9 + 16 + 22 + 29 + 53 + 74 + 79 + 81 = 363. </p><p> Encontre S (13082761331670030). </p></section>

## Instructions
<section id="instructions">
</section>

## Tests
<section id='tests'>

```yml
tests:
  - text: <code>euler271()</code> deve retornar 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();

```

</div>



</section>

## Solution
<section id='solution'>

```js
// solution required
```
</section>