In problem 4 from http://projecteuler.net/ it says:
A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-d
Here is my code to solve this problem.
lst = [] for i in range(100,1000): for n in range(2,i) : lst.append (i* n) lst.append(i*i) lst2=[] for i in lst: if str(i) == str(i)[::-1]: lst2.append(i) print max(lst2)