gistfile1.clj

(ns primeFactors)

(defn square [n] (* n n))

(defn divisible-by? [n candidate]
  (= 0 (rem n candidate)))

(defn of [n]
  (loop [factors [] n n candidate 2]
    (cond
      (= n 1) factors
      (divisible-by? n candidate) (recur (conj factors candidate) (/ n candidate) candidate)
      (> (square candidate) n) (conj factors n)
      :else (recur factors n (inc candidate)))))