Problem 4
A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99.
Find the largest palindrome made from the product of two 3-digit numbers.
# 寻找最大的回文数字,其中这个数字由两个三位数乘积得到。回文数指正序和逆序相同。
palindrome = []
list_tuple = []
for i in range(900,1000):
for j in range(900,1000):
product = i * j
str_pro = str(product)
if str_pro == str_pro[::-1]:
list_tuple.append((i,j))
palindrome.append(product)
print(palindrome)
maximum = max(palindrome)
max_index = palindrome.index(maximum)
print(list_tuple[max_index],maximum)
结果:906609 = 913 × 993
补充:Problem 3 中递归求质因数时,如果数字太大,会出现错误。
int(123124324324134334/2) = 61562162162067168 数字太大会出现精度问题,
因为整数存储是以科学计数存储,超过16位小数运算时会损失精度,
采用得 decimal.Decimal 可以默认控制28位,用 getcontext().prec = Inf. 设置更高精度。