2018-10-08 17:51:51 +00:00
---
2018-10-10 20:20:40 +00:00
id: 5900f46e1000cf542c50ff81
2018-10-08 17:51:51 +00:00
challengeType: 5
title: 'Problem 258: A lagged Fibonacci sequence'
2018-10-10 20:20:40 +00:00
videoUrl: ''
localeTitle: 'Problema 258: Una secuencia de Fibonacci retrasada'
2018-10-08 17:51:51 +00:00
---
## Description
2018-10-10 20:20:40 +00:00
< section id = "description" > Una secuencia se define como: < p > gk = 1, para 0 ≤ k ≤ 1999 gk = gk-2000 + gk-1999, para k ≥ 2000. Encuentre gk mod 20092010 para k = 1018. < / p > < / section >
2018-10-08 17:51:51 +00:00
## Instructions
2018-10-10 20:20:40 +00:00
< section id = "instructions" >
2018-10-08 17:51:51 +00:00
< / section >
## Tests
< section id = 'tests' >
```yml
tests:
- text: < code > euler258()</ code > debe devolver 12747994.
testString: 'assert.strictEqual(euler258(), 12747994, "< code > euler258()< / code > should return 12747994.");'
```
< / section >
## Challenge Seed
< section id = 'challengeSeed' >
< div id = 'js-seed' >
```js
function euler258() {
// Good luck!
return true;
}
euler258();
2018-10-10 20:20:40 +00:00
2018-10-08 17:51:51 +00:00
```
< / div >
< / section >
## Solution
< section id = 'solution' >
```js
// solution required
```
< / section >