62 lines
1.0 KiB
Markdown
62 lines
1.0 KiB
Markdown
|
---
|
||
|
|
id: 5
|
||
|
|
localeTitle: 5900f47b1000cf542c50ff8d
|
||
|
|
challengeType: 5
|
||
|
|
title: 'Problem 271: Modular Cubes, part 1'
|
||
|
|
---
|
||
|
|
|
||
|
|
## Description
|
||
|
|
<section id='description'>
|
||
|
|
Para un número positivo n, defina S (n) como la suma de los enteros x, para lo cual 1 <x<n andx3≡1 mod n.<code> 0
|
||
|
|
|
||
|
|
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.
|
||
|
|
|
||
|
|
Encuentra S (13082761331670030).
|
||
|
|
</section>
|
||
|
|
|
||
|
|
## Instructions
|
||
|
|
<section id='instructions'>
|
||
|
|
|
||
|
|
</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();
|
||
|
|
```
|
||
|
|
|
||
|
|
</div>
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
</section>
|
||
|
|
|
||
|
|
## Solution
|
||
|
|
<section id='solution'>
|
||
|
|
|
||
|
|
```js
|
||
|
|
// solution required
|
||
|
|
```
|
||
|
|
</section>
|