2018-10-08 17:51:51 +00:00
---
2018-10-10 20:20:40 +00:00
id: 5900f3e41000cf542c50fef7
2018-10-08 17:51:51 +00:00
challengeType: 5
title: 'Problem 120: Square remainders'
2018-10-10 20:20:40 +00:00
videoUrl: ''
localeTitle: 'Problema 120: Restos cuadrados'
2018-10-08 17:51:51 +00:00
---
## Description
2018-10-10 20:20:40 +00:00
< section id = "description" > Sea r el resto cuando (a − 1) n + (a + 1) n esté dividido por a2. Por ejemplo, si a = 7 y n = 3, entonces r = 42: 63 + 83 = 728 ≡ 42 mod 49. Y como n varía, también r, pero para a = 7 resulta que rmax = 42. Para 3 ≤ a ≤ 1000, encuentre ∑ rmax. < / section >
2018-10-08 17:51:51 +00:00
## Instructions
2018-10-10 20:20:40 +00:00
< section id = "instructions" >
2018-10-08 17:51:51 +00:00
< / section >
## Tests
< section id = 'tests' >
```yml
tests:
- text: < code > euler120()</ code > debe devolver 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();
2018-10-10 20:20:40 +00:00
2018-10-08 17:51:51 +00:00
```
< / div >
< / section >
## Solution
< section id = 'solution' >
```js
// solution required
```
< / section >