(define(smallest-divisor n)(find-divisor n 2))(define(find-divisor n test-divisor)(cond((>(square test-divisor) n) n)((divides? test-divisor n) test-divisor)(else(find-divisor n (next-iter test-divisor)))))(define(divides? a b)(=(remainder b a)0))(define(prime? n)(= n (smallest-divisor n)))(define(square x)(* x x))(define(timed-prime-test n)(newline)(display n)(start-prime-test n (runtime)))(define(start-prime-test n start-time)(if(prime? n)(report-prime(-(runtime) start-time))))(define(report-prime elapsed-time)(display"***")(display elapsed-time))(define(even? x)(=(remainder x 2)0))(define(next x)(cond((even? x)(+ x 1))(else x)))(define(search-for-primes now tot-num)(timed-prime-test(next now))(cond((= tot-num 0) #t)((and(prime? (next now))(= tot-num 1)) #t)((prime? (next now))(search-for-primes(+(next now)2)(- tot-num 1)))(else(search-for-primes(+(next now)2) tot-num))))(define(next-iter i)(cond((= i 2)3)(else(+ i 2))))(search-for-primes1003);寻找大于某个数的三个素数