SIGN IN SIGN UP
TheAlgorithms / Python UNCLAIMED

All Algorithms implemented in Python

0 0 1 Python

Added solution for Project Euler problem 119 (#2931)

Name: Digit power sum

Problem Statement: 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.
Find a30

Reference: https://projecteuler.net/problem=119

reference: #2695

Co-authored-by: Ravi Kandasamy Sundaram <[email protected]>
R
Ravi Kandasamy Sundaram committed
2b5b2c6304f68112484a599af6ce6121088e14c2
Parent: 501a2ff
Committed by GitHub <[email protected]> on 10/10/2020, 5:59:02 PM