Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
project euler 2, haskell
--http://www.haskell.org/haskellwiki/Euler_problems/1_to_10 --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. problem_2 = sum [ x | x <- takeWhile (<= 4000000) fibs, even x] where fibs = 1 : 1 : zipWith (+) fibs (tail fibs) main = print $ problem_2
run
|
edit
|
history
|
help
0
sumer
pascal triangle
Derive type class for parameterized data type
equiv_strings
ReaderPractice
divisibleBy a b
Traversable
Monoid and friends
Quicksort in Haskell
haskell fibonacci