Python Implementation of Problem 29

View source code here on GitHub!

Problem Solution

Project Euler Problem 29

Another good problem for code golf

Problem:

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

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

python.src.p0029.main() → int
 1"""
 2Project Euler Problem 29
 3
 4Another good problem for code golf
 5
 6Problem:
 7
 8Consider all integer combinations of a**b for 2 ≤ a ≤ 5 and 2 ≤ b ≤ 5:
 9
10    2**2=4, 2**3=8, 2**4=16, 2**5=32
11    3**2=9, 3**3=27, 3**4=81, 3**5=243
12    4**2=16, 4**3=64, 4**4=256, 4**5=1024
13    5**2=25, 5**3=125, 5**4=625, 5**5=3125
14
15If they are then placed in numerical order, with any repeats removed, we get
16the following sequence of 15 distinct terms:
17
184, 8, 9, 16, 25, 27, 32, 64, 81, 125, 243, 256, 625, 1024, 3125
19
20How many distinct terms are in the sequence generated by a**b for 2 ≤ a ≤ 100
21and 2 ≤ b ≤ 100?
22"""
23
24
25def main() -> int:
26    space = range(2, 101)
27    return len(set(a**b for a in space for b in space))

Tags: sequence-generator