Determine whether a given integer number is prime

	;; P31 (**) Determine whether a given integer number is prime.
	;; Example:
	;; * (is-prime 7)
	;; T
	#lang racket
	(provide is-prime?)
	(define (is-prime? n)
	(and (> n 1)
	(or (= n 2)
	(and (not (zero? (modulo n 2)))
	(let loop ((i 3))
	(or (> (* i i) n)
	(and (not (zero? (modulo n i)))
	(loop (+ i 2)))))))))

view raw p31.ss hosted with ❤ by GitHub