56 lines
1.1 KiB
Markdown
56 lines
1.1 KiB
Markdown
|
---
|
||
|
|
id: 5900f5041000cf542c510016
|
||
|
|
challengeType: 5
|
||
|
|
title: 'Problem 407: Idempotents'
|
||
|
|
videoUrl: ''
|
||
|
|
localeTitle: 'Задача 407: Идемпотент'
|
||
|
|
---
|
||
|
|
|
||
|
|
## Description
|
||
|
|
<section id="description"> Если мы вычислим a2 mod 6 для 0 ≤ a ≤ 5, получим: 0,1,4,3,4,1. <p> Наибольшее значение a такое, что a2 ≡ a mod 6 равно 4. Назовем M (n) наибольшим значением a <n таким, что a2 ≡ a (mod n). Итак, M (6) = 4. </p><p> Найти ΣM (n) для 1 ≤ n ≤ 107. </p></section>
|
||
|
|
|
||
|
|
## Instructions
|
||
|
|
<section id="instructions">
|
||
|
|
</section>
|
||
|
|
|
||
|
|
## Tests
|
||
|
|
<section id='tests'>
|
||
|
|
|
||
|
|
```yml
|
||
|
|
tests:
|
||
|
|
- text: ''
|
||
|
|
testString: 'assert.strictEqual(euler407(), 39782849136421, "<code>euler407()</code> should return 39782849136421.");'
|
||
|
|
|
||
|
|
```
|
||
|
|
|
||
|
|
</section>
|
||
|
|
|
||
|
|
## Challenge Seed
|
||
|
|
<section id='challengeSeed'>
|
||
|
|
|
||
|
|
<div id='js-seed'>
|
||
|
|
|
||
|
|
```js
|
||
|
|
function euler407() {
|
||
|
|
// Good luck!
|
||
|
|
return true;
|
||
|
|
}
|
||
|
|
|
||
|
|
euler407();
|
||
|
|
|
||
|
|
```
|
||
|
|
|
||
|
|
</div>
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
</section>
|
||
|
|
|
||
|
|
## Solution
|
||
|
|
<section id='solution'>
|
||
|
|
|
||
|
|
```js
|
||
|
|
// solution required
|
||
|
|
```
|
||
|
|
</section>
|