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?

 

Answer:

可以直接求解，没什么技巧

distlist = []for a in range(2, 101):    for b in range(2, 101):        if a**b not in distlist:            distlist.append(a**b)print(len(distlist)) 看过里面别人的答复，还有一种更简洁的，就是利用set来删除重复元素。这样只需要一句话就可以解决 len(set(a**b for a in range(2, 101) for b in range(2, 101)))