Problem4.py


1
2
3
4
5
6
7
8
9
10
11
12
13
14

def ispalandrome(n):
    n = list(str(n))
    m = list(reversed(n))
    if n == m:
        return True
    else:
        return False
largestpalindrome = 0   
for x in range(100,1000):
    for y in range(100,1000):
        if ispalandrome(x*y) and (x*y > largestpalindrome):
            largestpalindrome = (x*y)
            
print(largestpalindrome)