project Eulert 学习笔记 之 problem 29

Distinct powers

Problem 29

Consider all integer combinations of a^b for 2 ≤ a ≤ 5 and 2 ≤ b ≤ 5:

2²=4, 2³=8, 2⁴=16, 2⁵=32
3²=9, 3³=27, 3⁴=81, 3⁵=243
4²=16, 4³=64, 4⁴=256, 4⁵=1024
5²=25, 5³=125, 5⁴=625, 5⁵=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

How many distinct terms are in the sequence generated by a^b for 2 ≤ a ≤ 100 and 2 ≤ b ≤ 100?

这套题也在网上看了其他大神的解决方案，但是我觉得是不是复杂了一些，其实可以很简单的完成，比如这样：

numlist = []

#创建分组
for i in range(2,101,1):

    #给出a的范围
    for j in range(2,101,1):

        #给出b的范围
        s = i ** j

        #求出a的b次方的数值
        if s in numlist:
            continue

        else:
            numlist.append(s)

         #将数值插入分组，如果还没有出现过的话

print(len(numlist))

答案为：9183