gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Feat: add new Markdown parser (#39800)

Browse Source 
and change all the challenges to new `md` format.
This commit is contained in:
Oliver Eyton-Williams
2020-11-27 19:02:05 +01:00
committed by GitHub
parent a07f84c8ec
commit 0bd52f8bd1
2580 changed files with 113436 additions and 111979 deletions
Download Patch File Download Diff File Expand all files Collapse all files

46
curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-407-idempotents.md
View File

@ -1,44 +1,29 @@
---
id: 5900f5041000cf542c510016
challengeType: 5
title: 'Problem 407: Idempotents'
challengeType: 5
forumTopicId: 302075
---
## Description
<section id='description'>
# --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.
The largest value of a such that a2 ≡ a mod 6 is 4. Let's call M(n) the largest value of a &lt; n such that a2 ≡ a (mod n). So M(6) = 4.
Find ∑M(n) for 1 ≤ n ≤ 107.
</section>
## Instructions
<section id='instructions'>
# --hints--
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler407()</code> should return 39782849136421.
testString: assert.strictEqual(euler407(), 39782849136421);
`euler407()` should return 39782849136421.
```js
assert.strictEqual(euler407(), 39782849136421);
```
</section>
# --seed--
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
## --seed-contents--
```js
function euler407() {
@ -49,17 +34,8 @@ function euler407() {
euler407();
```
</div>
</section>
## Solution
<section id='solution'>
# --solutions--
```js
// solution required
```
</section>