freeCodeCamp/curriculum/challenges/portuguese/08-coding-interview-prep/project-euler/problem-401-sum-of-squares-...

56 lines
1.2 KiB
Markdown
Raw Normal View History

---
id: 5900f4fd1000cf542c51000f
challengeType: 5
title: 'Problem 401: Sum of squares of divisors'
videoUrl: ''
localeTitle: 'Problema 401: Soma dos quadrados dos divisores'
---
## Description
<section id="description"> Os divisores de 6 são 1,2,3 e 6. A soma dos quadrados desses números é 1 + 4 + 9 + 36 = 50. <p> Deixe sigma2 (n) representar a soma dos quadrados dos divisores de n. Assim sigma2 (6) = 50. </p><p> Deixe SIGMA2 representar a função somativa de sigma2, ou seja, SIGMA2 (n) = ∑sigma2 (i) para i = 1 a n. Os primeiros 6 valores do SIGMA2 são: 1,6,16,37,63 e 113. </p><p> Encontre SIGMA2 (1015) módulo 109. </p></section>
## Instructions
<section id="instructions">
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler401()</code> deve retornar 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>