sicp 1.21

找出最小因子的算法：

 

(define (smallest-divisor n)
  (find-divisor n 2))

(define (find-divisor n test-divisor)
  (cond ((> (square test-divisor) n) n)
        ((= (remainder n test-divisor) 0) test-divisor)
        (else (find-divisor n (+ test-divisor 1)))))

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

 

(smallest-divisor 199)

>199

(smallest-divisor 1999)

>1999

(smallest-divisor 19999)

>7