|
(Python)
def is_palindrome(n):
if n<10: return True
n = str(n)
midpoint = int(len(n)/2)
return n[:midpoint] == n[-midpoint:][::-1]
lower_bound = 10**(n-1) - 1
upper_bound = 10**n - 1
max_palindromes = (0, 0, 0)
for n1 in range(upper_bound, lower_bound, -1):
for n2 in range(n1, lower_bound, -1):
n = n1* n2
if is_palindrome(n) and n>max_palindromes[2]:
max_palindromes = (n1, n2, n)
if n < max_palindromes[2]:
break
if n1*n1 < max_palindromes[2]:
break
return max_palindromes
if __name__ == '__main__':
for n in range(1, 7):
| 