2.2 KiB
2.2 KiB
id | challengeType | title | videoUrl | localeTitle |
---|---|---|---|---|
5900f3851000cf542c50fe98 | 5 | Problem 25: 1000-digit Fibonacci number | Problema 25: número Fibonacci de 1000 dígitos |
Description
F n = F n − 1 + F n − 2 , onde F 1 = 1 e F 2 = 1.
Por isso, os primeiros 12 termos serão: F 1 = 1
F 2 = 1
F 3 = 2
F 4 = 3
F 5 = 5
F 6 = 8
F 7 = 13
F 8 = 21
F 9 = 34
F 10 = 55
F 11 = 89
F 12 = 144
Instructions
Tests
tests:
- text: <code>digitFibonacci(5)</code> deve retornar 21.
testString: 'assert.strictEqual(digitFibonacci(5), 21, "<code>digitFibonacci(5)</code> should return 21.");'
- text: <code>digitFibonacci(10)</code> deve retornar 45.
testString: 'assert.strictEqual(digitFibonacci(10), 45, "<code>digitFibonacci(10)</code> should return 45.");'
- text: <code>digitFibonacci(15)</code> deve retornar 69.
testString: 'assert.strictEqual(digitFibonacci(15), 69, "<code>digitFibonacci(15)</code> should return 69.");'
- text: <code>digitFibonacci(20)</code> deve retornar 93.
testString: 'assert.strictEqual(digitFibonacci(20), 93, "<code>digitFibonacci(20)</code> should return 93.");'
Challenge Seed
function digitFibonacci(n) {
// Good luck!
return n;
}
digitFibonacci(20);
Solution
// solution required