(define prime-check (lambda (x) (if (<= x 1) #f (let loop ((test (- x 1))) (if (eq? test 1) #t (and (not (eq? (modulo x test) 0)) (loop (- test 1))))))))