1. Forum
  2. USENET
  3. comp.lang.lisp

  • Re: project euler problems

    From B. Pym@Nobody447095@here-nor-there.org to comp.lang.lisp on Fri Aug 15 10:05:40 2025
    From Newsgroup: comp.lang.lisp

    Problem 4.

    Find the largest palindrome made from the product of two 3-digit
    numbers.

    Gauche Scheme

    (use srfi-42) ;; max-ec

    (max-ec (:range m 100 1000)(:range n 100 1000)
    (:let p (* m n))
    (:let s (x->string p))
    (if (equal? s (string-reverse s)))
    p)

    ===>
    906609


    --- Synchronet 3.21a-Linux NewsLink 1.2