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.
return True if moji == moji[::-1] else False
print max([ x * y for x in xrange(100,1000) for y in xrange(100,1000) \
if is_palindrome(str(x * y))])
Praline Well, you told me it was Ipswich.
Shopkeeper It was a pun.
Praline A pun?
Shopkeeper No, no, not a pun, no. What's the other thing which reads the same backwards as forwards?
Praline A palindrome?
Shopkeeper Yes, yes.
Praline It's not a palindrome. The palindrome of Bolton would be Notlob. It don't work.