47 lines
885 B
Markdown
47 lines
885 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--
|
||
|
|
|
||
|
|
`euler377()` should return 732385277.
|
||
|
|
|
||
|
|
```js
|
||
|
|
assert.strictEqual(euler377(), 732385277);
|
||
|
|
```
|
||
|
|
|
||
|
|
# --seed--
|
||
|
|
|
||
|
|
## --seed-contents--
|
||
|
|
|
||
|
|
```js
|
||
|
|
function euler377() {
|
||
|
|
|
||
|
|
return true;
|
||
|
|
}
|
||
|
|
|
||
|
|
euler377();
|
||
|
|
```
|
||
|
|
|
||
|
|
# --solutions--
|
||
|
|
|
||
|
|
```js
|
||
|
|
// solution required
|
||
|
|
```
|