freeCodeCamp/problem-119-digit-power-sum.english.md at ef79ddd0de35a4e10b8b4588e67938f86d2bae10

Files

mrugesh 22afc2a0ca feat(learn): python certification projects (#38216 )

Co-authored-by: Oliver Eyton-Williams <ojeytonwilliams@gmail.com>
Co-authored-by: Kristofer Koishigawa <scissorsneedfoodtoo@gmail.com>
Co-authored-by: Beau Carnes <beaucarnes@gmail.com>

2020-05-27 13:19:08 +05:30

1.0 KiB

Raw Blame History

id, challengeType, isHidden, title, forumTopicId

id	challengeType	isHidden	title	forumTopicId
5900f3e41000cf542c50fef6	5	false	Problem 119: Digit power sum	301745

Description

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.

Instructions

Tests

tests:
  - text: <code>euler119()</code> should return 248155780267521.
    testString: assert.strictEqual(euler119(), 248155780267521);

Challenge Seed

function euler119() {
  // Good luck!
  return true;
}

euler119();

Solution

// solution required

1.0 KiB Raw Blame History