Ian Dorian Macleod
Problem 4
Problem Statement

A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 $\times$ 99.

Find the largest palindrome made from the product of two 3-digit numbers.

url: https://projecteuler.net/problem=3
Approach
Python implementation

import math

res = 0

def palindrome(x):
    strx = str(x)
    for i in range(0, int(len(strx)/2)):
        if strx[i] != strx[-(i+1)]:
            return False
    return True


def find_max():
    ans = 0
    for i in range(1000, 100, -1):
        for j in range(1000, 100, -1):
            res = i*j
            if palindrome(res):
                ans = max(ans, res)
    return ans
                
res = find_max()
print("Answer is " + str(res))
You can also download the source code for this problem here and compile it on your local machine.
Further Analysis