Skip to content

Instantly share code, notes, and snippets.

@jnape
Created November 4, 2012 20:51
Show Gist options
  • Save jnape/4013723 to your computer and use it in GitHub Desktop.
Save jnape/4013723 to your computer and use it in GitHub Desktop.
Solution to Project Euler #2 in Haskell
module Euler2 where
{-
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.
-}
fibs :: [Int]
fibs = 0 : 1 : zipWith (+) fibs (tail fibs)
main :: IO ()
main = print $ sum $ filter even $ takeWhile (< 4000000) fibs
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment