aboutsummaryrefslogtreecommitdiff
path: root/haskell/002-even_fibonacci_numbers.hs
diff options
context:
space:
mode:
Diffstat (limited to 'haskell/002-even_fibonacci_numbers.hs')
-rw-r--r--haskell/002-even_fibonacci_numbers.hs26
1 files changed, 26 insertions, 0 deletions
diff --git a/haskell/002-even_fibonacci_numbers.hs b/haskell/002-even_fibonacci_numbers.hs
new file mode 100644
index 0000000..ff5de91
--- /dev/null
+++ b/haskell/002-even_fibonacci_numbers.hs
@@ -0,0 +1,26 @@
+-- Even Fibonacci numbers
+
+-- Problem 2
+-- 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.
+
+
+main = do
+ print (sum (filter even (fib_until 4000000)))
+
+fib_until threshold = fib_from_index_until 0 threshold
+
+fib_from_index_until :: Int -> Int -> [Int]
+fib_from_index_until i threshold
+ | fib_i < threshold = fib_i:(fib_from_index_until (i + 1) threshold)
+ | otherwise = []
+ where fib_i = fibonacci i
+
+fibonacci :: Int -> Int
+fibonacci 0 = 0
+fibonacci 1 = 1
+fibonacci 2 = 1
+fibonacci x = fibonacci (x - 1) + fibonacci (x - 2)