Problem 258: A lagged Fibonacci sequence
A sequence is defined as:
gk = 1, for 0 ≤ k ≤ 1999 gk = gk-2000 + gk-1999, for k ≥ 2000. Find gk mod 20092010 for k = 1018.
Test
{{test}}Console output
A sequence is defined as:
gk = 1, for 0 ≤ k ≤ 1999 gk = gk-2000 + gk-1999, for k ≥ 2000. Find gk mod 20092010 for k = 1018.
Use Cmd instead of Ctrl if you're on a Mac.
| g | Focus editor |
| Ctrl-Enter | Run the test with current code |
| Ctrl-Shift-K | Reset the editor |
| Ctrl-Shift-L | Clear console output |
| Ctrl-Shift-X | Show the solution |
| [ | Previous challenge |
| ] | Next challenge |
| T | Back to top page |
| ? | Show this dialog |
| ESC | Hide this dialog |
| Shift-ESC | Blur focus from editor |