ee1e8abd87
* feat(tools): add seed/solution restore script * chore(curriculum): remove empty sections' markers * chore(curriculum): add seed + solution to Chinese * chore: remove old formatter * fix: update getChallenges parse translated challenges separately, without reference to the source * chore(curriculum): add dashedName to English * chore(curriculum): add dashedName to Chinese * refactor: remove unused challenge property 'name' * fix: relax dashedName requirement * fix: stray tag Remove stray `pre` tag from challenge file. Signed-off-by: nhcarrigan <nhcarrigan@gmail.com> Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
50 lines
847 B
Markdown
50 lines
847 B
Markdown
---
|
|
id: 5900f4181000cf542c50ff2a
|
|
title: >-
|
|
Problem 171: Finding numbers for which the sum of the squares of the digits is
|
|
a square
|
|
challengeType: 5
|
|
forumTopicId: 301806
|
|
dashedName: >-
|
|
problem-171-finding-numbers-for-which-the-sum-of-the-squares-of-the-digits-is-a-square
|
|
---
|
|
|
|
# --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.
|
|
|
|
# --hints--
|
|
|
|
`euler171()` should return 142989277.
|
|
|
|
```js
|
|
assert.strictEqual(euler171(), 142989277);
|
|
```
|
|
|
|
# --seed--
|
|
|
|
## --seed-contents--
|
|
|
|
```js
|
|
function euler171() {
|
|
|
|
return true;
|
|
}
|
|
|
|
euler171();
|
|
```
|
|
|
|
# --solutions--
|
|
|
|
```js
|
|
// solution required
|
|
```
|