65 lines
1.1 KiB
Markdown
65 lines
1.1 KiB
Markdown
![]() |
---
|
||
|
id: 5
|
||
|
localeTitle: 5900f4c11000cf542c50ffd3
|
||
|
challengeType: 5
|
||
|
title: 'Problem 341: Golomb"s self-describing sequence'
|
||
|
---
|
||
|
|
||
|
## Description
|
||
|
<section id='description'>
|
||
|
La secuencia autodescriptiva de Golomb {G (n)} es la única secuencia no decreciente de números naturales, por lo que n aparece exactamente G (n) veces en la secuencia. Los valores de G (n) para los primeros n son
|
||
|
|
||
|
|
||
|
n123456789101112131415… G (n) 122334445556666…
|
||
|
|
||
|
Se le da que G (103) = 86, G (106) = 6137.
|
||
|
También se le da eso ΣG (n3) = 153506976 para 1 ≤ n <103.
|
||
|
|
||
|
Encuentre ΣG (n3) para 1 ≤ n <106.
|
||
|
</section>
|
||
|
|
||
|
## Instructions
|
||
|
<section id='instructions'>
|
||
|
|
||
|
</section>
|
||
|
|
||
|
## Tests
|
||
|
<section id='tests'>
|
||
|
|
||
|
```yml
|
||
|
tests:
|
||
|
- text: <code>euler341()</code> debe devolver 56098610614277016.
|
||
|
testString: 'assert.strictEqual(euler341(), 56098610614277016, "<code>euler341()</code> should return 56098610614277016.");'
|
||
|
|
||
|
```
|
||
|
|
||
|
</section>
|
||
|
|
||
|
## Challenge Seed
|
||
|
<section id='challengeSeed'>
|
||
|
|
||
|
<div id='js-seed'>
|
||
|
|
||
|
```js
|
||
|
function euler341() {
|
||
|
// Good luck!
|
||
|
return true;
|
||
|
}
|
||
|
|
||
|
euler341();
|
||
|
```
|
||
|
|
||
|
</div>
|
||
|
|
||
|
|
||
|
|
||
|
</section>
|
||
|
|
||
|
## Solution
|
||
|
<section id='solution'>
|
||
|
|
||
|
```js
|
||
|
// solution required
|
||
|
```
|
||
|
</section>
|