56 lines
1.0 KiB
Markdown
56 lines
1.0 KiB
Markdown
---
|
|
id: 5900f5231000cf542c510035
|
|
challengeType: 5
|
|
title: 'Problem 439: Sum of sum of divisors'
|
|
videoUrl: ''
|
|
localeTitle: 'Problema 439: Suma de suma de divisores'
|
|
---
|
|
|
|
## Description
|
|
<section id="description"> Sea d (k) la suma de todos los divisores de k. Definimos la función S (N) = ∑1≤i≤N ∑1≤j≤Nd (i · j). Por ejemplo, S (3) = d (1) + d (2) + d (3) + d (2) + d (4) + d (6) + d (3) + d (6) + d ( 9) = 59. <p> Se le da a S (103) = 563576517282 y S (105) mod 109 = 215766508. Encuentre S (1011) mod 109. </p></section>
|
|
|
|
## Instructions
|
|
<section id="instructions">
|
|
</section>
|
|
|
|
## Tests
|
|
<section id='tests'>
|
|
|
|
```yml
|
|
tests:
|
|
- text: <code>euler439()</code> debe devolver 968697378.
|
|
testString: 'assert.strictEqual(euler439(), 968697378, "<code>euler439()</code> should return 968697378.");'
|
|
|
|
```
|
|
|
|
</section>
|
|
|
|
## Challenge Seed
|
|
<section id='challengeSeed'>
|
|
|
|
<div id='js-seed'>
|
|
|
|
```js
|
|
function euler439() {
|
|
// Good luck!
|
|
return true;
|
|
}
|
|
|
|
euler439();
|
|
|
|
```
|
|
|
|
</div>
|
|
|
|
|
|
|
|
</section>
|
|
|
|
## Solution
|
|
<section id='solution'>
|
|
|
|
```js
|
|
// solution required
|
|
```
|
|
</section>
|