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 four million, find the sum of the even-valued terms.
It's easy enough to generate the Fibonacci number that is less than 4 million by recursively and saving each Fibonacci numbers: $$F_n = F_{n-1} + F_{n-2}, \,\, F_0 = 0, \,\, F_1 = 1$$
With every single new Fibonacci number created, we just have to check if it's even or not and to our total sum if that's the case
Answer: 4613732
Runtime: 0.51 ms