Long primes: Difference between revisions

m
(→‎{{header|Common Lisp}}: Add implementation.)
Line 519:
((some #'zerop (mapcar (lambda (d) (mod n d)) '(2 3))) nil)
(t (loop for i = 5 then (+ i 6)
while (<= (* i i) n)
when (some #'zerop (mapcar (lambda (d) (mod n (+ i d))) '(0 2))) return nil
finally (return t)))))
 
(defun long-prime? (n)
1,480

edits