long winded lcm

(defn divide-if-remainderless [a b]
        (if (zero? (mod a b)) (/ a b) a ))

(defn divide-table-while-integer
        ([table divisor]
                (divide-table-while-integer table divisor 0))
        ([table divisor n]
                (let [divided-table (map #(divide-if-remainderless % divisor) table)]
                        (if (= table divided-table) [table n]
                                (recur divided-table divisor (inc n))))))                        

(defn lcm
        ([table]
                (lcm table 1 [2 3 5 7 9 11 13 17 19]))
        ([table result primes]
                (let [prime (first primes)
                      [updated-table num-divisions] (divide-table-while-integer table prime)
                      new-lcm (apply * (cons result (repeat num-divisions prime)))]
                        (if-let [rest-primes (next primes)] (lcm updated-table new-lcm rest-primes)
                                new-lcm))))

(lcm (range 1 11))