(defn prime? [n]
    (let [q (int (Math/sqrt n))]
     (not-any? #(zero? %) (map #(rem n %) (range 2 (inc q))))))

(reduce + (take-while #(< % 2000000) (filter prime? (iterate inc 2))))