Project Euler Problem #4


Largest palindrome from product of two 3-digit numbers:


 


let isPalendrome n =


    let s = n.ToString() |> List.of_seq


    s = List.rev s


seq { for a in 100..999 do


      for b in a..999 -> a * b }


|> Seq.filter isPalendrome |> Seq.max

Comments (0)