• Re: project euler problems

    From B. Pym@21:1/5 to All on Fri Aug 15 10:05:40 2025
    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

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)