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 Python code:
max_pal = 0 for i in range(100,999): for j in range(100,999): mult = i * j if str(mult) == str(mult)[::-1]: #Check if the number is palindrome if mult > max_pal: max_pal = mult print (max_pal)