anchor.diff:    (if (>= (length seqA) (length seqB))
         seqA
         seqB))
  -
   
   (defun longest-chain (seq &optional prev chain backup)
     (cond ((endp seq) (if (null backup)
  
positive.code: 
  (defun search-pos (search-item search-list)
    "return the list of positions search-item (a list) matches in search-list"
    (let ((win (make-list(length search-item)))
  		(store nil))
  	(dotimes (i (length search-list) store)
  	  (setf win (append
  
negative.code:     (powerr x (- y 1) (* x pro))))
  
  ;;
  ;; Question
  ;; 
  ;;
  ;; Define a recursive procedure that returns the sum of a geometric progression
  ;; with $n$ terms and the initial term $a$ and the common ratio $r$.
  ;;
  
  (defun geo (a r n &optional (product 1) (sum 0))
    (if (zerop n)
        (* a sum)
        (geo a r (- n 1) (* product r) (+ sum product))))
  
  
  ;; Question
  ;;
  ;; Compute the average of two integers m and n (where m < n)  
  