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
This browser is no longer supported.
Upgrade to Microsoft Edge to take advantage of the latest features, security updates, and technical support.
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