Tag Archives: short circuits

(Haskell) Euler Problem 4

A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 * 99. Find the largest palindrome made from the product of two 3-digit numbers. There are shorter ways to do this, and I cheat a bit by counting down to 900 rather [...]

Posted in Haskell | Also tagged , , , , | Leave a comment