Problem 004

004:

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.

Answer: 906609

 

def ispalindrome(s):
    if len(s) <= 1:
        return True
    else:
        return s[0] == s[-1] and ispalindrome(s[1:-1])

if __name__ == "__main__":
    g = []
    for i in range(100,1000):
        for j in range(100,1000):
            p = str(i*j)
            if ispalindrome(p):
                g.append(int(p))
    print max(g)