My Clojure Sieve of Eratosthenes

sieve.clj

(defn sieve
  ([numbers primes composites]

   (cond  (empty? numbers) primes
          (contains? composites (first numbers) )   (do (sieve (rest numbers) primes composites))
          :else (do
                (def current (first numbers))
                (def new-primes (conj primes current))
                (def new-composites
                     (into (sorted-set) (concat composites (range (* 2 current ) (inc (last numbers))  current))))

                (sieve (seq(rest numbers)) new-primes new-composites))))


  ([number] (sieve (range 2 (inc number))  [] (sorted-set))))

use (sieve <int>) to find all the prime numbers from 2 to, inclusive
https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes