Project Euler 119: Investigating the numbers which are equal to sum of their digits raised to some power
The number 512 is interesting because it is equal to the sum of its digits raised to some power: 5 + 1 + 2 = 8, and 83 = 512. Another example of a number with this property is 614656 = 284.
We shall define an to be the nth term of this sequence and insist that a number must contain at least two digits to have a sum.
You are given that a2 = 512 and a10 = 614656.
Taking advantage of the easy large integer support in Python, we iterated two loops representing the base and exponent with the intention of accommodating inquiries up to a200. Ignoring ab values < 10 it was a simple process of adding the digits of the powers and comparing that sum to the base. After collecting relevant values into an array, it was sorted and the proper index printed for the answer.
Project Euler 119 SolutionRuns < 0.006 seconds in Python 2.7.
def sum_of_digits(n): return sum(map(int, str(n))) a =  n = 30 for b in range(2, 100): for e in range(2, 10): p = b ** e if sum_of_digits(p) == b: a.append(p) a.sort() print "Answer to PE119 = a(%d) =" % n, a[n-1]Use this link to get the Project Euler 119 Solution Python 2.7 source.
AnswerSlowly swipe from either end beginning with the white vertical bar to get an idea of the starting or ending digits. For less drama, just double click the answer area. The distance between the two bars will give you an idea of the magnitude. Touch devices can tap and hold the center of the box between the two bars and choose define to reveal the answer.
- The base index of arrays in Python begin with 0. We need to subtract one from our index because the problem is using a base of 1; a30 = a.