gistfile1.txt

;;euler problem 7
(defn prime-mod [num primes]
  (zero? (count (filter (fn [x] (zero? (mod num x))) primes))))

(defn solve-euler7
  ([] (solve-euler7 [2] 3))
  ([primes num]
     (println "# of primes: " (count primes))
     (cond
      (= 10000 (count primes)) (last primes)
      (prime-mod num primes) (recur (conj primes num) (inc num))
      (not (prime-mod num primes)) (recur primes (inc num)))))