freeCodeCamp/curriculum/challenges/portuguese/08-coding-interview-prep/project-euler/problem-120-square-remainde...

56 lines
1005 B
Markdown
Raw Normal View History

---
id: 5900f3e41000cf542c50fef7
challengeType: 5
title: 'Problem 120: Square remainders'
videoUrl: ''
localeTitle: 'Problema 120: Restos Quadrados'
---
## Description
<section id="description"> Seja r o resto quando (a 1) n + (a + 1) n é dividido por a2. Por exemplo, se a = 7 en = 3, então r = 42: 63 + 83 = 728 ≡ 42 mod 49. E como n varia, também será r, mas para a = 7 verifica-se que rmax = 42. Para 3 ≤ a ≤ 1000, encontre ∑ rmax. </section>
## Instructions
<section id="instructions">
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler120()</code> deve retornar 333082500.
testString: 'assert.strictEqual(euler120(), 333082500, "<code>euler120()</code> should return 333082500.");'
```
</section>
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
```js
function euler120() {
// Good luck!
return true;
}
euler120();
```
</div>
</section>
## Solution
<section id='solution'>
```js
// solution required
```
</section>