def is_reversible(n): sum_num = n + num_reverse(n) if list(str(n))[0] == "0" or list(str(n))[-1] == "0": return False elif is_all_odd(sum_num): return True else: return False
def main(): max_value = 0 products = [] for i in range(100, 1000): for j in range(100, 1000): product = i * j if product == num_reverse(product): products.append(product) products.sort() print products[len(products)-1]
def sub1(num): """num = 349, return 349 + 943 = 1292""" return num + num_reverse(num)