63 lines
1.0 KiB
Markdown
63 lines
1.0 KiB
Markdown
|
---
|
||
|
|
id: 5
|
||
|
|
localeTitle: 5900f44e1000cf542c50ff60
|
||
|
|
challengeType: 5
|
||
|
|
title: 'Problem 225: Tribonacci non-divisors'
|
||
|
|
---
|
||
|
|
|
||
|
|
## Description
|
||
|
|
<section id='description'>
|
||
|
|
La secuencia 1, 1, 1, 3, 5, 9, 17, 31, 57, 105, 193, 355, 653, 1201 ...
|
||
|
|
se define por T1 = T2 = T3 = 1 y Tn = Tn-1 + Tn-2 + Tn-3.
|
||
|
|
|
||
|
|
|
||
|
|
Se puede mostrar que 27 no divide ningún término de esta secuencia. De hecho, 27 es el primer número impar de esta propiedad.
|
||
|
|
|
||
|
|
Encuentre el número impar número 124 que no divide ningún término de la secuencia anterior.
|
||
|
|
</section>
|
||
|
|
|
||
|
|
## Instructions
|
||
|
|
<section id='instructions'>
|
||
|
|
|
||
|
|
</section>
|
||
|
|
|
||
|
|
## Tests
|
||
|
|
<section id='tests'>
|
||
|
|
|
||
|
|
```yml
|
||
|
|
tests:
|
||
|
|
- text: <code>euler225()</code> debe devolver 2009.
|
||
|
|
testString: 'assert.strictEqual(euler225(), 2009, "<code>euler225()</code> should return 2009.");'
|
||
|
|
|
||
|
|
```
|
||
|
|
|
||
|
|
</section>
|
||
|
|
|
||
|
|
## Challenge Seed
|
||
|
|
<section id='challengeSeed'>
|
||
|
|
|
||
|
|
<div id='js-seed'>
|
||
|
|
|
||
|
|
```js
|
||
|
|
function euler225() {
|
||
|
|
// Good luck!
|
||
|
|
return true;
|
||
|
|
}
|
||
|
|
|
||
|
|
euler225();
|
||
|
|
```
|
||
|
|
|
||
|
|
</div>
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
</section>
|
||
|
|
|
||
|
|
## Solution
|
||
|
|
<section id='solution'>
|
||
|
|
|
||
|
|
```js
|
||
|
|
// solution required
|
||
|
|
```
|
||
|
|
</section>
|