num
, return the sum of all odd Fibonacci numbers that are less than or equal to num
.
The first two numbers in the Fibonacci sequence are 1 and 1. Every additional number in the sequence is the sum of the two previous numbers. The first six numbers of the Fibonacci sequence are 1, 1, 2, 3, 5 and 8.
For example, sumFibs(10)
should return 10
because all odd Fibonacci numbers less than or equal to 10
are 1, 1, 3, and 5.
Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code.
sumFibs(1)
should return a number.
testString: assert(typeof sumFibs(1) === "number", 'sumFibs(1)
should return a number.');
- text: sumFibs(1000)
should return 1785.
testString: assert(sumFibs(1000) === 1785, 'sumFibs(1000)
should return 1785.');
- text: sumFibs(4000000)
should return 4613732.
testString: assert(sumFibs(4000000) === 4613732, 'sumFibs(4000000)
should return 4613732.');
- text: sumFibs(4)
should return 5.
testString: assert(sumFibs(4) === 5, 'sumFibs(4)
should return 5.');
- text: sumFibs(75024)
should return 60696.
testString: assert(sumFibs(75024) === 60696, 'sumFibs(75024)
should return 60696.');
- text: sumFibs(75025)
should return 135721.
testString: assert(sumFibs(75025) === 135721, 'sumFibs(75025)
should return 135721.');
```