Files
freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-377-sum-of-digits-experience-13.md
gikf 7d9496e52c fix(curriculum): clean-up Project Euler 361-380 (#43002)
* fix: clean-up Project Euler 361-380

* fix: improve wording

Co-authored-by: Sem Bauke <46919888+Sembauke@users.noreply.github.com>

* fix: remove unnecessary paragraph

* fix: corrections from review

Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>

Co-authored-by: Sem Bauke <46919888+Sembauke@users.noreply.github.com>
Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>
2021-07-29 12:48:17 -07:00

47 lines
903 B
Markdown

---
id: 5900f4e51000cf542c50fff8
title: 'Problem 377: Sum of digits, experience 13'
challengeType: 5
forumTopicId: 302039
dashedName: 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.
# --hints--
`experience13()` should return `732385277`.
```js
assert.strictEqual(experience13(), 732385277);
```
# --seed--
## --seed-contents--
```js
function experience13() {
return true;
}
experience13();
```
# --solutions--
```js
// solution required
```