highest palindrome with 3 digit numbers in python

Question

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

Answer 1

def div(n):
    for i in range(999,99,-1):
        if n%i == 0:
            x = n/i
            if x % 1 == 0:
                x = n//i
                if len(str(x)) == 3:
                    print(i)
                    return True
    return False


def palindrome():
    ans = []
    for x in range(100*100,999*999+1):
        s = str(x)
        s = int (s[::-1])
        if x - s == 0:
            ans.append(x)

    for x in range(len(ans)):
        y = ans.pop()
        if div(y):
            return y


print(palindrome())