67 lines
1.1 KiB
Markdown
67 lines
1.1 KiB
Markdown
---
|
|
id: 5900f4e51000cf542c50fff8
|
|
challengeType: 5
|
|
title: 'Problem 377: Sum of digits, experience 13'
|
|
forumTopicId: 302039
|
|
---
|
|
|
|
## Description
|
|
<section id='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.
|
|
</section>
|
|
|
|
## Instructions
|
|
<section id='instructions'>
|
|
|
|
</section>
|
|
|
|
## Tests
|
|
<section id='tests'>
|
|
|
|
```yml
|
|
tests:
|
|
- text: <code>euler377()</code> should return 732385277.
|
|
testString: assert.strictEqual(euler377(), 732385277);
|
|
|
|
```
|
|
|
|
</section>
|
|
|
|
## Challenge Seed
|
|
<section id='challengeSeed'>
|
|
|
|
<div id='js-seed'>
|
|
|
|
```js
|
|
function euler377() {
|
|
|
|
return true;
|
|
}
|
|
|
|
euler377();
|
|
```
|
|
|
|
</div>
|
|
|
|
|
|
|
|
</section>
|
|
|
|
## Solution
|
|
<section id='solution'>
|
|
|
|
```js
|
|
// solution required
|
|
```
|
|
|
|
</section>
|