anchor.diff:    (iterate (for-nested ((i :from 0 :to 999)
                           (j :from 0 :to 999)))
              (for product = (* i j))
  -           (when (definitely-palindrome-p product)
  +           (when (palindromep product)
                (maximize product))))
   
   (defun problem-5 ()
  
positive.code:                (when (pandigitalp result)
                   (in main (maximizing result)))))))
  
  
  ;;;; Tests --------------------------------------------------------------------
  (def-suite :euler)
  
negative.code:   ;;
    ;; There exists exactly one Pythagorean triplet for which a + b + c = 1000.
    ;; Find the product abc.
    (product (first (pythagorean-triplets-of-perimeter 1000))))
  
  (defun problem-10 ()
    ;; The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.
  