anchor.diff:        (loop
           (incf loop-counter)
           (if (>= loop-counter 100) (return loop-counter)))
  -      (assert-equal ___ loop-counter)))
  +      (assert-equal 100 loop-counter)))
   
   
   (define-test test-mapcar
       "mapcar takes a list and a function.  It returns a new list
        with the function applied to each element of the input"
     (let ((mc-result (mapcar #'evenp '(1 2 3 4 5))))
  -    (assert-equal mc-result ____)))
  +    (assert-equal mc-result '(nil t nil t nil))))
   
   
   ;; ----
  
positive.code:       (if (> one-prime biggest-in-list)
            (setf biggest-in-list one-prime))
        (incf how-many-in-list))
      (assert-equal ___ how-many-in-list)
      (assert-equal ___ biggest-in-list))
    (let ((sum 0))
      "write your own dolist here to calculate the sum of some-primes"
      "you may be interested in investigating the 'incf' function"
      ;(dolist ... )
      (assert-equal 999607602 sum)))
  
  
  
negative.code:           (my-return))
        (dolist (x my-list my-return)
          (push (* x x) my-return))
        (assert-equal '(16 9 4 1) my-return)))
  
  
  (define-test test-dotimes
  