2021-06-15 07:49:18 +00:00
---
id: 5900f3e41000cf542c50fef7
title: 'Problem 120: Square remainders'
challengeType: 5
forumTopicId: 301747
dashedName: problem-120-square-remainders
---
# --description--
2021-07-10 04:23:54 +00:00
Let `r` be the remainder when ${(a − 1)}^n + {(a + 1)}^n$ is divided by $a^2$.
2021-06-15 07:49:18 +00:00
2021-07-10 04:23:54 +00:00
For example, if $a = 7$ and $n = 3$, then $r = 42: 6^3 + 8^3 = 728 ≡ 42 \\ \text{mod}\\ 49$. And as `n` varies, so too will `r` , but for $a = 7$ it turns out that $r_{max} = 42$.
2021-06-15 07:49:18 +00:00
2021-07-10 04:23:54 +00:00
For $3 ≤ a ≤ 1000$, find $\sum{r}_{max}$.
2021-06-15 07:49:18 +00:00
# --hints--
2021-07-10 04:23:54 +00:00
`squareRemainders()` should return `333082500` .
2021-06-15 07:49:18 +00:00
```js
2021-07-10 04:23:54 +00:00
assert.strictEqual(squareRemainders(), 333082500);
2021-06-15 07:49:18 +00:00
```
# --seed--
## --seed-contents--
```js
2021-07-10 04:23:54 +00:00
function squareRemainders() {
2021-06-15 07:49:18 +00:00
return true;
}
2021-07-10 04:23:54 +00:00
squareRemainders();
2021-06-15 07:49:18 +00:00
```
# --solutions--
```js
// solution required
```