56 lines
1.2 KiB
Markdown
56 lines
1.2 KiB
Markdown
---
|
|
id: 5900f4181000cf542c50ff2a
|
|
challengeType: 5
|
|
title: 'Problem 171: Finding numbers for which the sum of the squares of the digits is a square'
|
|
videoUrl: ''
|
|
localeTitle: 'Problema 171: encontrar números para los cuales la suma de los cuadrados de los dígitos es un cuadrado'
|
|
---
|
|
|
|
## Description
|
|
<section id="description"> Para un entero positivo n, sea f (n) la suma de los cuadrados de los dígitos (en la base 10) de n, por ejemplo, f (3) = 32 = 9, f (25) = 22 + 52 = 4 + 25 = 29, f (442) = 42 + 42 + 22 = 16 + 16 + 4 = 36 Encuentre los últimos nueve dígitos de la suma de todos n, 0 <n <1020, de modo que f (n) sea un cuadrado perfecto. </section>
|
|
|
|
## Instructions
|
|
<section id="instructions">
|
|
</section>
|
|
|
|
## Tests
|
|
<section id='tests'>
|
|
|
|
```yml
|
|
tests:
|
|
- text: <code>euler171()</code> debe devolver 142989277.
|
|
testString: 'assert.strictEqual(euler171(), 142989277, "<code>euler171()</code> should return 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>
|