Project Euler 29 Problem Statement

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

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

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

Solution

Build a set of distinct ab terms using Python’s set data type and print the set’s length.

r = range(2, 101)
print "Project Euler 29 Solution =", len({a**b for a in r for b in r})

HackerRank version

HackerRank Project Euler 29 increases the upper range from 100 to 100000.

Python 2.7 Source

Last Word