ee1e8abd87
* feat(tools): add seed/solution restore script * chore(curriculum): remove empty sections' markers * chore(curriculum): add seed + solution to Chinese * chore: remove old formatter * fix: update getChallenges parse translated challenges separately, without reference to the source * chore(curriculum): add dashedName to English * chore(curriculum): add dashedName to Chinese * refactor: remove unused challenge property 'name' * fix: relax dashedName requirement * fix: stray tag Remove stray `pre` tag from challenge file. Signed-off-by: nhcarrigan <nhcarrigan@gmail.com> Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
43 lines
669 B
Markdown
43 lines
669 B
Markdown
---
|
|
id: 5900f5041000cf542c510016
|
|
title: 'Problem 407: Idempotents'
|
|
challengeType: 5
|
|
forumTopicId: 302075
|
|
dashedName: problem-407-idempotents
|
|
---
|
|
|
|
# --description--
|
|
|
|
If we calculate a2 mod 6 for 0 ≤ a ≤ 5 we get: 0,1,4,3,4,1.
|
|
|
|
The largest value of a such that a2 ≡ a mod 6 is 4. Let's call M(n) the largest value of a < n such that a2 ≡ a (mod n). So M(6) = 4.
|
|
|
|
Find ∑M(n) for 1 ≤ n ≤ 107.
|
|
|
|
# --hints--
|
|
|
|
`euler407()` should return 39782849136421.
|
|
|
|
```js
|
|
assert.strictEqual(euler407(), 39782849136421);
|
|
```
|
|
|
|
# --seed--
|
|
|
|
## --seed-contents--
|
|
|
|
```js
|
|
function euler407() {
|
|
|
|
return true;
|
|
}
|
|
|
|
euler407();
|
|
```
|
|
|
|
# --solutions--
|
|
|
|
```js
|
|
// solution required
|
|
```
|