SICP 1.21 答案

很简单

(define (smallest-divisor n)
  (find-divisor n 2))
(define (find-divisor n test-divisor)
  (cond ((> (* test-divisor test-divisor) n) n)
        ((divides? test-divisor n) test-divisor)
        (else (find-divisor n (+ test-divisor 1)))))
(define (divides? a b)
  (= (remainder b a) 0))

(smallest-divisor 199)   ;199
(smallest-divisor 1999)  ;1999
(smallest-divisor 19999) ;7

你可能感兴趣的:(Scheme)