### Careful with that infinite list, Eugene...

Warning: this will give away one way to solve a certain low-numbered Project Euler problem.

Any Haskell book, blog, or tutorials you come across has a good chance of including the

Thanks to laziness, it will only evaluate out to the last term we actually request... that was, long ago, my downfall. I wanted the terms no bigger than four million, so

right? Wrong. You and I know that the Fibonacci sequence is monotonically increasing, but

is the way to go.

The particular problem has an additional constraint, because it only wants the even terms of the sequence no bigger than four million. Easy enough to do, just feed it through

…

Any Haskell book, blog, or tutorials you come across has a good chance of including the

*très élégant*Haskell one-liner for an infinite list containing the Fibonacci sequence:**fibs = 0 : 1 : (zipWith (+) fibs (tail fibs))**Thanks to laziness, it will only evaluate out to the last term we actually request... that was, long ago, my downfall. I wanted the terms no bigger than four million, so

**filter (<= 4000000) fibs**right? Wrong. You and I know that the Fibonacci sequence is monotonically increasing, but

**filter**doesn't, and it doesn't even notice the particular function we're filtering with to realize it could terminate thanks to monotonicity. So instead,**takeWhile (<= 4000000) fibs**is the way to go.

The particular problem has an additional constraint, because it only wants the even terms of the sequence no bigger than four million. Easy enough to do, just feed it through

**filter even**…