corecursive infinite list of primes in clojure

primes.clj

(defn divides?
  [x y]
  (and (= 0 (mod x y)) (not (= x y))))

(def primes
  (lazy-cat
    [2 3]
    (filter
      (fn [x]
        (not (some
          #(divides? x %)
          (take-while
            #(<= % (Math/ceil (Math/sqrt x)))
            primes))))
      (iterate inc 5))))

(defn prime? [x]
  (not (some
    #(divides? x %)
    (take-while
      #(<= % (Math/ceil (Math/sqrt x)))
      primes))))