Primality by trial division: Difference between revisions

The function used in both versions:

<lang clojure>(defn divides? [k n] (zero? (mod k n)))</lang>

Simple loop from &nbsp; '''3''' &nbsp; to &nbsp; '''&radic;{{overline|&nbsp;n&nbsp;}} &nbsp;''' with step '''2''':

<lang clojure>(defn prime? [x]

A similar method, but only with prime divisors:

<lang clojure>(declare prime?)

(def primes (filter prime? (range)))

(defn prime? [x]

(or (= 2 x)

(and (integer? x)

(< 1 x)

(not-any? (partial divides? x)

(take-while (partial > (math/sqrt x)) primes)))))

</lang>