62 lines
1.0 KiB
Markdown
62 lines
1.0 KiB
Markdown
|
---
|
||
|
|
id: 5
|
||
|
|
localeTitle: 5900f47d1000cf542c50ff8f
|
||
|
|
challengeType: 5
|
||
|
|
title: 'Problem 272: Modular Cubes, part 2'
|
||
|
|
---
|
||
|
|
|
||
|
|
## Description
|
||
|
|
<section id='description'>
|
||
|
|
Para un número positivo n, defina C (n) como el número de los enteros x, para los cuales 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, C (91) = 8.
|
||
|
|
|
||
|
|
Encuentra la suma de los números positivos n≤1011 para los que C (n) = 242.
|
||
|
|
</section>
|
||
|
|
|
||
|
|
## Instructions
|
||
|
|
<section id='instructions'>
|
||
|
|
|
||
|
|
</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();
|
||
|
|
```
|
||
|
|
|
||
|
|
</div>
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
</section>
|
||
|
|
|
||
|
|
## Solution
|
||
|
|
<section id='solution'>
|
||
|
|
|
||
|
|
```js
|
||
|
|
// solution required
|
||
|
|
```
|
||
|
|
</section>
|