freeCodeCamp/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-377-sum-of-digits-experience-13.english.md
Valeriy 79d9012432 fix(curriculum): quotes in tests (#18828)
* fix(curriculum): tests quotes

* fix(curriculum): fill seed-teardown

* fix(curriculum): fix tests and remove unneeded seed-teardown
2018-10-20 23:32:47 +05:30

1.1 KiB

id, challengeType, title
id challengeType title
5900f4e51000cf542c50fff8 5 Problem 377: Sum of digits, experience 13

Description

There are 16 positive integers that do not have a zero in their digits and that have a digital sum equal to 5, namely: 5, 14, 23, 32, 41, 113, 122, 131, 212, 221, 311, 1112, 1121, 1211, 2111 and 11111. Their sum is 17891.

Let f(n) be the sum of all positive integers that do not have a zero in their digits and have a digital sum equal to n.

Find \displaystyle \sum_{i=1}^{17} f(13^i). Give the last 9 digits as your answer.

Instructions

Tests

tests:
  - text: <code>euler377()</code> should return 732385277.
    testString: assert.strictEqual(euler377(), 732385277, '<code>euler377()</code> should return 732385277.');

Challenge Seed

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

euler377();

Solution

// solution required