2018-10-08 17:51:51 +00:00
---
2018-10-10 20:20:40 +00:00
id: 5900f43f1000cf542c50ff52
2018-10-08 17:51:51 +00:00
challengeType: 5
title: 'Problem 211: Divisor Square Sum'
2018-10-10 20:20:40 +00:00
videoUrl: ''
localeTitle: 'Problema 211: Divisor Cuadrado Suma'
2018-10-08 17:51:51 +00:00
---
## Description
2018-10-10 20:20:40 +00:00
< 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. Encuentre la suma de todos n, 0 < n < 64,000,000 de manera que σ 2 (n) sea un cuadrado perfecto. < / section >
2018-10-08 17:51:51 +00:00
## Instructions
2018-10-10 20:20:40 +00:00
< section id = "instructions" >
2018-10-08 17:51:51 +00:00
< / 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();
2018-10-10 20:20:40 +00:00
2018-10-08 17:51:51 +00:00
```
< / div >
< / section >
## Solution
< section id = 'solution' >
```js
// solution required
```
< / section >