Euler Project: Problem 2 in Clojure

This is my solution in Clojure to the second problem from Euler project:

	(def fibonaccis
	(map first (iterate (fn [[a b]] [b (+ a b)]) [0 1])))
	(def evens-in (partial filter even?))
	(defn fibonaccis-below [num]
	(take-while (partial > num) fibonaccis))
	(reduce + 0 (evens-in (fibonaccis-below 4000000)))

view raw euler2.clj hosted with ❤ by GitHub

I created some helpers just to make the solution a bit more readable.