Project Euler Problem 3

; https://projecteuler.net/problem=3

(defn divides [a b]
        (= (mod b a) 0))

(defn prime [p]
    (every? (fn [i] (not (divides i p))) (range 2 p)))

(println (reduce max 0 (filter prime
    (filter (fn [i] (divides i 600851475143)) (range 2 775147)))))