Files

Oliver Eyton-Williams ee1e8abd87 feat(curriculum): restore seed + solution to Chinese (#40683 )

* feat(tools): add seed/solution restore script

* chore(curriculum): remove empty sections' markers

* chore(curriculum): add seed + solution to Chinese

* chore: remove old formatter

* fix: update getChallenges

parse translated challenges separately, without reference to the source

* chore(curriculum): add dashedName to English

* chore(curriculum): add dashedName to Chinese

* refactor: remove unused challenge property 'name'

* fix: relax dashedName requirement

* fix: stray tag

Remove stray `pre` tag from challenge file.

Signed-off-by: nhcarrigan <nhcarrigan@gmail.com>

Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>

2021-01-12 19:31:00 -07:00

1.3 KiB

Raw Permalink Blame History

id, title, challengeType, forumTopicId, dashedName

id	title	challengeType	forumTopicId	dashedName
5900f38a1000cf542c50fe9d	Problem 30: Digit n powers	5	301953	problem-30-digit-n-powers

--description--

Surprisingly there are only three numbers that can be written as the sum of fourth powers of their digits:

1634 = 1⁴ + 6⁴ + 3⁴ + 4⁴
8208 = 8⁴ + 2⁴ + 0⁴ + 8⁴
9474 = 9⁴ + 4⁴ + 7⁴ + 4⁴

As 1 = 1⁴ is not a sum it is not included.

The sum of these numbers is 1634 + 8208 + 9474 = 19316.

Find the sum of all the numbers that can be written as the sum of n powers of their digits.

--hints--

digitnPowers(2) should return a number.

assert(typeof digitnPowers(2) === 'number');

digitnPowers(2) should return 0.

assert(digitnPowers(2) == 0);

digitnPowers(3) should return 1301.

assert(digitnPowers(3) == 1301);

digitnPowers(4) should return 19316.

assert(digitnPowers(4) == 19316);

digitnPowers(5) should return 443839.

assert(digitnPowers(5) == 443839);

--seed--

--seed-contents--

function digitnPowers(n) {

  return n;
}

digitnPowers(5);

--solutions--

// solution required

1.3 KiB Raw Permalink Blame History