Вычисление суммы кубов

;; racket-lang.org
(define (foo)
  (let ((lst (range 25 56 1))
        (cube (lambda (x) (* x x x))))
    (for/fold ([sum 0])
              ([i (map cube lst)])
      (+ sum i))))
 
(foo)
;2281600

(defun sum-cube (n m)
  (loop for a from n to m sum (expt a 3)))
 
> (sum-cube 25 55)
2281600

(defun sum-cube (n m)
  (cond ((= n m) (expt n 3))
        ((+ (expt n 3) (sum-cube (1+ n) m)))))
 
> (sum-cube 25 55)
2281600

(defun sum-cube (n m)
  (if (= n m) (expt n 3) (+ (expt n 3) (sum-cube (1+ n) m))))
 
> (sum-cube 25 55)
2281600

(defun sum-cube (n m)
  (+ (expt n 3) (if (= n m) 0 (sum-cube (1+ n) m))))
 
> (sum-cube 25 55)
2281600

(defun sum-cube (n m)
  (+ (* n n n) (if (= n m) 0 (sum-cube (+ n 1) m))))
 
> (sum-cube 25 55)
2281600

(defun nums (n)
  (cons n 
        (lambda () (nums (+ 1 n)))))
 
(defun sumCube (a b ls)
  (if (> a b)
      0
      (+ (expt (car ls) 3)
         (sumCube (+ a 1)
                  b
                  (funcall (cdr ls))))))
 
(defun task (n m)
  (sumCube n m (nums n)))
 
(task 25 55)
 
==> 2281600

(defun sum-qube (n1 n2)
  (iter (for i from n1 to n2) (summing (* i i i))))
 
 
==> sum-qube
(sum-qube 25 55)
 
==> 2281600
 
(defun sum-qube (n1 n2)
  (apply '+ (mapcar #'(lambda (x) (^ x 3)) (range n1 n2))))
 
==> sum-qube
 
(sum-qube 25 55)
 
==> 2281600