22afc2a0ca
Co-authored-by: Oliver Eyton-Williams <ojeytonwilliams@gmail.com> Co-authored-by: Kristofer Koishigawa <scissorsneedfoodtoo@gmail.com> Co-authored-by: Beau Carnes <beaucarnes@gmail.com>
63 lines
1013 B
Markdown
63 lines
1013 B
Markdown
---
|
|
id: 5900f4181000cf542c50ff2a
|
|
challengeType: 5
|
|
isHidden: false
|
|
title: 'Problem 171: Finding numbers for which the sum of the squares of the digits is a square'
|
|
forumTopicId: 301806
|
|
---
|
|
|
|
## Description
|
|
<section id='description'>
|
|
For a positive integer n, let f(n) be the sum of the squares of the digits (in base 10) of n, e.g.
|
|
f(3) = 32 = 9,
|
|
f(25) = 22 + 52 = 4 + 25 = 29,
|
|
f(442) = 42 + 42 + 22 = 16 + 16 + 4 = 36
|
|
Find the last nine digits of the sum of all n, 0 < n < 1020, such that f(n) is a perfect square.
|
|
</section>
|
|
|
|
## Instructions
|
|
<section id='instructions'>
|
|
|
|
</section>
|
|
|
|
## Tests
|
|
<section id='tests'>
|
|
|
|
```yml
|
|
tests:
|
|
- text: <code>euler171()</code> should return 142989277.
|
|
testString: assert.strictEqual(euler171(), 142989277);
|
|
|
|
```
|
|
|
|
</section>
|
|
|
|
## Challenge Seed
|
|
<section id='challengeSeed'>
|
|
|
|
<div id='js-seed'>
|
|
|
|
```js
|
|
function euler171() {
|
|
// Good luck!
|
|
return true;
|
|
}
|
|
|
|
euler171();
|
|
```
|
|
|
|
</div>
|
|
|
|
|
|
|
|
</section>
|
|
|
|
## Solution
|
|
<section id='solution'>
|
|
|
|
```js
|
|
// solution required
|
|
```
|
|
|
|
</section>
|