Python

mathdatech/Python

Fork 0

mirror of https://github.com/TheAlgorithms/Python.git synced 2024-10-06 13:49:30 +00:00

Commit Graph

Author	SHA1	Message	Date
Christian Clauss	cecf43d648	Pyupgrade to Python 3.9 (#4718 ) * Pyupgrade to Python 3.9 * updating DIRECTORY.md Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>	2021-09-07 13:37:03 +02:00
Ravi Kandasamy Sundaram	2b5b2c6304	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 <rkandasamysundaram@luxoft.com>	2020-10-10 23:29:02 +05:30

Author

SHA1

Message

Date

Christian Clauss

cecf43d648

Pyupgrade to Python 3.9 (#4718 )

* Pyupgrade to Python 3.9

* updating DIRECTORY.md

Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>

2021-09-07 13:37:03 +02:00

Ravi Kandasamy Sundaram

2b5b2c6304

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 <rkandasamysundaram@luxoft.com>

2020-10-10 23:29:02 +05:30

2 Commits