SICP 1.2.6素数检测 fermat检测

对于数n，fermat检测一次需要$log(n)$的复杂度，检测k次，复杂度为$k*log(n)$.

(define (expmod base exp m)
  (cond ((= exp 0) 1)
        ((even? exp) (remainder (square (expmod base (/ exp 2) m)) m))
        (else (remainder (* base (expmod base (- exp 1) m)) m))))

(define (fermat-test n)
  (define (try-it a)
    (= (expmod a n n) a))
  (try-it (+ 1 (random (- n 1)))))

(define (fast-prime? n times)
  (cond ((= times 0) #t)
        ((fermat-test n) (fast-prime? n (- times 1)))
        (else #f)))

(define (even? x)
  (= (remainder x 2) 0))

(define (square x)
  (* x x))

(fast-prime? 11 3)