anchor.diff:    (iterate (for-nested ((i :from 0 :to 999)
                           (j :from 0 :to 999)))
              (for product = (* i j))
  -           (when (palindromep product)
  +           (when (definitely-palindrome-p product)
                (maximize product))))
   
   (defun problem-5 ()
  
positive.code: (test p32 (is (= 45228 (problem-32))))
  (test p33 (is (= 100 (problem-33))))
  (test p34 (is (= 40730 (problem-34))))
  
  
  ;; (run! :euler)
  
negative.code:     (iterate (for i :in (primes-below 1000000))
               (counting (circular-prime-p i)))))
  
  (defun problem-36 ()
    ;; The decimal number, 585 = 1001001001 (binary), is palindromic in both
    ;; bases.
    ;;
    ;; Find the sum of all numbers, less than one million, which are palindromic
    ;; in base 10 and base 2.
    ;;
    ;; (Please note that the palindromic number, in either base, may not include
    ;; leading zeros.)
    (iterate (for i :from 1 :below 1000000)
             (when (and (palindromep i 10)
                        (palindromep i 2))
               (sum i))))
  
  
  ;;;; Tests --------------------------------------------------------------------
  (def-suite :euler)
  