59 lines
940 B
Markdown
59 lines
940 B
Markdown
|
---
|
|||
|
|
id: 5
|
|||
|
|
localeTitle: 5900f43f1000cf542c50ff52
|
|||
|
|
challengeType: 5
|
|||
|
|
title: 'Problem 211: Divisor Square Sum'
|
|||
|
|
---
|
|||
|
|
|
|||
|
|
## Description
|
|||
|
|
<section id='description'>
|
|||
|
|
Para un entero positivo n, sea σ2 (n) la suma de los cuadrados de sus divisores. Por ejemplo,
|
|||
|
|
σ2 (10) = 1 + 4 + 25 + 100 = 130.
|
|||
|
|
Halla la suma de todos n, 0 <n <64,000,000 de manera que σ2 (n) sea un cuadrado perfecto.
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Instructions
|
|||
|
|
<section id='instructions'>
|
|||
|
|
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Tests
|
|||
|
|
<section id='tests'>
|
|||
|
|
|
|||
|
|
```yml
|
|||
|
|
tests:
|
|||
|
|
- text: <code>euler211()</code> debe devolver 1922364685.
|
|||
|
|
testString: 'assert.strictEqual(euler211(), 1922364685, "<code>euler211()</code> should return 1922364685.");'
|
|||
|
|
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Challenge Seed
|
|||
|
|
<section id='challengeSeed'>
|
|||
|
|
|
|||
|
|
<div id='js-seed'>
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
function euler211() {
|
|||
|
|
// Good luck!
|
|||
|
|
return true;
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
euler211();
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
</div>
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Solution
|
|||
|
|
<section id='solution'>
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
// solution required
|
|||
|
|
```
|
|||
|
|
</section>
|