Problem 29
Consider all integer combinations of ab for 2 ≤ a ≤ 5 and 2 ≤ b ≤ 5:
仔细看看以下a与b的组合
22=4, 23=8, 24=16, 25=32
32=9, 33=27, 34=81, 35=243
42=16, 43=64, 44=256, 45=1024
52=25, 53=125, 54=625, 55=3125
If they are then placed in numerical order, with any repeats removed, we get the following sequence of 15 distinct terms:
如果移除重复项,并排序,得出如下:
4, 8, 9, 16, 25, 27, 32, 64, 81, 125, 243, 256, 625, 1024, 3125
有多少个不重复的数字可以由a的b次方得出?(2 ≤ a ≤ 100 and 2 ≤ b ≤ 100)
How many distinct terms are in the sequence generated by ab for 2 ≤ a ≤ 100 and 2 ≤ b ≤ 100?
import math
sequence = []
for a in range(2, 101):
for b in range(2, 101):
sequence.append(math.pow(a, b))
print(len(set(sequence))) # 将列表转换为集合,自动去重