(def is-prime1 [n]
	(if (some #(if (mod n %) true false) (range 2 n))
		true
		false))

(def is-prime2 [n]
	(loop [i 2, prime true]
		(if (and prime (< i n))
			(if (zero? (mod n i))
				(recur nil false)
				(recur (inc i) true))
			prime)))