Learning Clojure with Project Euler (opens in new tab)

The second solution will run indefinitely:

  (defn e2 [limit]
    (filter #(and (< % limit)
             (zero? (mod % 2)))
          fibs))

The third solution is also broken, it works fine for small values of n but enter a large number such as is given in the problem and you quickly run out of stack. Replacing the recursive call with recur will enable tail-call optimisation and give your stack a lot more breathing room.

I recommend the clojure-euler wiki for more reliable examples of good clojure code :)

nice ;)

Actually, on serious note, a great way to compare if your clojure code looks anything like it should.

> (range 1 (- limit 1))

this is wrong, it should be: (range 1 limit)

which will produce: (1 2 3 ... 999)

My old 32 bit machine died and the original (crappy) C solution now segfaults immediately, and was much slower.

Anyway, calculating and summing all the fibonacci numbers in less than half a millisecond is pretty cool.