Code Review
Compare your solutions
#| BEGIN (Введите свое решение) |#
(define (filtered-accumulate combiner null-value term a next b filter)
(define (iter a result)
(cond [(> a b) result]
[(filter a) (iter (next a) (combiner (term a) result))]
[else (iter (next a) result)]))
(iter a null-value))
(define (prime? n)
(define (smallest-divisor n)
(find-divisor n 2))
(define (find-divisor n test-devisor)
(cond
[(> (square test-devisor) n) n]
[(dividers? test-devisor n) test-devisor]
[else (find-divisor n (+ test-devisor 1))]))
(define (dividers? a b)
(= (remainder b a) 0))
(= n (smallest-divisor n)))
(define (prime-square-sum a b)
(filtered-accumulate + 0 square a inc b prime?))
#| END |#