problem010.clj

;; The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.
;; Find the sum of all the primes below two million.

(use 'clojure.contrib.lazy-seqs)

(defn sum-of-primes [limit]
  (reduce + (for [p primes :while (< p limit)] p)))

(sum-of-primes 2000000)