65 lines
1.0 KiB
Markdown
65 lines
1.0 KiB
Markdown
|
---
|
||
|
|
id: 5
|
||
|
|
localeTitle: 5900f5191000cf542c51002c
|
||
|
|
challengeType: 5
|
||
|
|
title: 'Problem 429: Sum of squares of unitary divisors'
|
||
|
|
---
|
||
|
|
|
||
|
|
## Description
|
||
|
|
<section id='description'>
|
||
|
|
Un divisor unitario d de un número n es un divisor de n que tiene la propiedad gcd (d, n / d) = 1.
|
||
|
|
Los divisores unitarios de 4! = 24 son 1, 3, 8 y 24.
|
||
|
|
La suma de sus cuadrados es 12 + 32 + 82 + 242 = 650.
|
||
|
|
|
||
|
|
|
||
|
|
Sea S (n) la suma de los cuadrados de los divisores unitarios de n. Así S (4!) = 650.
|
||
|
|
|
||
|
|
|
||
|
|
Encuentra S (100 000 000!) Módulo 1 000 000 009.
|
||
|
|
</section>
|
||
|
|
|
||
|
|
## Instructions
|
||
|
|
<section id='instructions'>
|
||
|
|
|
||
|
|
</section>
|
||
|
|
|
||
|
|
## Tests
|
||
|
|
<section id='tests'>
|
||
|
|
|
||
|
|
```yml
|
||
|
|
tests:
|
||
|
|
- text: <code>euler429()</code> debe devolver 98792821.
|
||
|
|
testString: 'assert.strictEqual(euler429(), 98792821, "<code>euler429()</code> should return 98792821.");'
|
||
|
|
|
||
|
|
```
|
||
|
|
|
||
|
|
</section>
|
||
|
|
|
||
|
|
## Challenge Seed
|
||
|
|
<section id='challengeSeed'>
|
||
|
|
|
||
|
|
<div id='js-seed'>
|
||
|
|
|
||
|
|
```js
|
||
|
|
function euler429() {
|
||
|
|
// Good luck!
|
||
|
|
return true;
|
||
|
|
}
|
||
|
|
|
||
|
|
euler429();
|
||
|
|
```
|
||
|
|
|
||
|
|
</div>
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
</section>
|
||
|
|
|
||
|
|
## Solution
|
||
|
|
<section id='solution'>
|
||
|
|
|
||
|
|
```js
|
||
|
|
// solution required
|
||
|
|
```
|
||
|
|
</section>
|