--- id: 5900f36e1000cf542c50fe81 challengeType: 5 title: 'Problem 2: Even Fibonacci Numbers' --- ## Description
Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be:
1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...
By considering the terms in the Fibonacci sequence whose values do not exceed nth term, find the sum of the even-valued terms.
## Instructions
## Tests
```yml tests: - text: fiboEvenSum(10) should return 188. testString: assert.strictEqual(fiboEvenSum(10), 188, 'fiboEvenSum(10) should return 188.'); - text: fiboEvenSum(23) should return 60696. testString: assert.strictEqual(fiboEvenSum(23), 60696, 'fiboEvenSum(23) should return 60696.'); - text: fiboEvenSum(43) should return 1485607536. testString: assert.strictEqual(fiboEvenSum(43), 1485607536, 'fiboEvenSum(43) should return 1485607536.'); - text: Your function is not returning the correct result using our tests values. testString: assert.strictEqual(fiboEvenSum(18), 3382, 'Your function is not returning the correct result using our tests values.'); - text: Your function should return an even value. testString: assert.equal(fiboEvenSum(31) % 2 === 0, true, 'Your function should return an even value.'); ```
## Challenge Seed
```js function fiboEvenSum(n) { // You can do it! return true; } fiboEvenSum(10); ```
## Solution
```js const fiboEvenSum = (number) => { let temp, sum = 0, a = 0, b = 1; while (number >= 0) { temp = a; a = b; b += temp; number --; if ((b % 2) === 0) { sum += b; } } return sum; } ```