56 lines
987 B
Markdown
56 lines
987 B
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> a2≡amod 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: <code>euler407()</code>应该返回39782849136421。
|
||
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>
|