freeCodeCamp/problem-30-digit-n-powers.english.md at c5a087f8b734f9eff9ad6966014d3f6cc88f7034

Files

Kristofer Koishigawa 6cfd0fc503 fix: improve Project Euler descriptions, challenge seeds, and test cases (#38016 )

* fix: improve Project Euler descriptions and test case

Improve formatting of Project Euler test descriptions. Also add poker hands array and new test case for problem 54

* feat: add typeof tests and gave functions proper names for first 100 challenges

* fix: continue fixing test descriptions and adding "before test" sections

* fix: address review comments

* fix: adjust grids in 18 and 67 and fix some text that reference files rather than the given arrays

* fix: implement bug fixes and improvements from review

* fix: remove console.log statements from seed and solution

2020-02-28 06:39:47 -06:00

1.6 KiB

Raw Blame History

id, challengeType, title, forumTopicId

id	challengeType	title	forumTopicId
5900f38a1000cf542c50fe9d	5	Problem 30: Digit n powers	301953

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.

Instructions

Tests

tests:
  - text: <code>digitnPowers(2)</code> should return a number.
    testString: assert(typeof digitnPowers(2) === 'number');
  - text: <code>digitnPowers(2)</code> should return 0.
    testString: assert(digitnPowers(2) == 0);
  - text: <code>digitnPowers(3)</code> should return 1301.
    testString: assert(digitnPowers(3) == 1301);
  - text: <code>digitnPowers(4)</code> should return 19316.
    testString: assert(digitnPowers(4) == 19316);
  - text: <code>digitnPowers(5)</code> should return 443839.
    testString: assert(digitnPowers(5) == 443839);

Challenge Seed

function digitnPowers(n) {
  // Good luck!
  return n;
}

digitnPowers(5);

Solution

// solution required

1.6 KiB Raw Blame History