68 lines
1.1 KiB
Markdown
68 lines
1.1 KiB
Markdown
|
---
|
||
|
|
id: 5
|
||
|
|
localeTitle: 5900f4fd1000cf542c51000f
|
||
|
|
challengeType: 5
|
||
|
|
title: 'Problem 401: Sum of squares of divisors'
|
||
|
|
---
|
||
|
|
|
||
|
|
## Description
|
||
|
|
<section id='description'>
|
||
|
|
Los divisores de 6 son 1,2,3 y 6.
|
||
|
|
La suma de los cuadrados de estos números es 1 + 4 + 9 + 36 = 50.
|
||
|
|
|
||
|
|
|
||
|
|
Sea sigma2 (n) la suma de los cuadrados de los divisores de n.
|
||
|
|
Así sigma2 (6) = 50.
|
||
|
|
|
||
|
|
Deje que SIGMA2 represente la función sumatoria de sigma2, que es SIGMA2 (n) = ∑sigma2 (i) para i = 1 a n.
|
||
|
|
Los primeros 6 valores de SIGMA2 son: 1,6,16,37,63 y 113.
|
||
|
|
|
||
|
|
|
||
|
|
Encuentra SIGMA2 (1015) módulo 109.
|
||
|
|
</section>
|
||
|
|
|
||
|
|
## Instructions
|
||
|
|
<section id='instructions'>
|
||
|
|
|
||
|
|
</section>
|
||
|
|
|
||
|
|
## Tests
|
||
|
|
<section id='tests'>
|
||
|
|
|
||
|
|
```yml
|
||
|
|
tests:
|
||
|
|
- text: <code>euler401()</code> debe devolver 281632621.
|
||
|
|
testString: 'assert.strictEqual(euler401(), 281632621, "<code>euler401()</code> should return 281632621.");'
|
||
|
|
|
||
|
|
```
|
||
|
|
|
||
|
|
</section>
|
||
|
|
|
||
|
|
## Challenge Seed
|
||
|
|
<section id='challengeSeed'>
|
||
|
|
|
||
|
|
<div id='js-seed'>
|
||
|
|
|
||
|
|
```js
|
||
|
|
function euler401() {
|
||
|
|
// Good luck!
|
||
|
|
return true;
|
||
|
|
}
|
||
|
|
|
||
|
|
euler401();
|
||
|
|
```
|
||
|
|
|
||
|
|
</div>
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
</section>
|
||
|
|
|
||
|
|
## Solution
|
||
|
|
<section id='solution'>
|
||
|
|
|
||
|
|
```js
|
||
|
|
// solution required
|
||
|
|
```
|
||
|
|
</section>
|