def lychrel_recursive(n, i=1): if i == 50: return True n = n + int(str(n)[::-1]) if palindromic(n): return False else: return lychrel_recursive(n, i + 1)
# find the largest palindrome of the product of two 3-digit numbers from pe_utils import palindromic i = 0 j = 0 high_palind = 0 # first three digit number 100-999 for i in range(1000, 100, -1): # second three digit number 100-999 for j in range(1000, 100, -1): mult = i * j if palindromic(mult) and mult > high_palind: print("palindrome: ", mult, " = ", i, " x ", j) high_palind = mult print("highest palindrome: ", high_palind) # print([x*y for x in range(100, 1000) for y in range(100, 1000)])