My Haskell work

I have solved about 76 problems on projecteuler.net so far. All my solutions were in Python and/or Java.

This is my blog where I am posting solutions in Haskell. I am have started learning it and this is my attempt at understanding how to create solutions in Haskell--and learn functional programming along the way.

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, ...

Find the sum of all the even-valued terms in the sequence which do not exceed four million.

---

problem2 =
  sum [n | n <- takeWhile (<=4000000) fibs, even n]
  where
  fibs = 1 : 1 : zipWith (+) fibs (tail fibs)

---

Problem 1

If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23.

Find the sum of all the multiples of 3 or 5 below 1000.

---

sum[n | n <- [1..999], (mod n 5 == 0) || (mod n 3 == 0)]

---