(defun prime(n)
(and
(> n 1) ;;picky case so we don't say numbers <=1 are prime
(forall (nums 2 (floor (sqrt n)))
#'(lambda (divisor) (not (= (mod n divisor) 0)))
))))
(defun prime(n)
(and
(> n 1) ;;picky case so we don't say numbers <=1 are prime
(forall (nums 2 (floor (sqrt n)))
#'(lambda (divisor) (not (= (mod n divisor) 0)))
))))