Project Euler solutions in Clojure (4-6)

euler-4.clj

(defn palindrome? [n] (let [numseq (seq (str n))] (= (reverse numseq) numseq)))

(defn euler-4 []
  (apply max 
    (for [x (range 999 900 -1) y (range x 900 -1) 
      :when (palindrome? (* x y))] 
      (* x y))))

euler-5.clj

(defn divisible-by-sequence? [n xs]
  (every? zero? (map #(rem n %) xs)))

(defn euler-5 []
  (first (filter #(divisible-by-sequence? % (range 11 21)) (iterate #(+ 2520 %) 2520))))

euler-6.clj

(defn euler-6 []
  (let [nums (range 1 101)
    s1 (int (Math/pow (reduce + nums), 2))
    s2 (int (reduce + (map #(Math/pow % 2) nums)))]

    (- s1 s2)))