[Previous entry: "English Entropy"] [Next entry: "Surely You're Joking"]

02/17/2010: "Project Euler #4"

Problem #4 of Project Euler states:

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

The standard answer seems to be "906609 = 993 x 913".

But after writing a few lines of Clojure I came up with a better answer: "0941490 = 990 x 951". The difference is that I allowed a leading zero, which wasn't forbidden in the problem statement.

Clever, huh?