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

48
curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-447-retractions-c.md
View File

@ -1,46 +1,31 @@
---
id: 5900f52c1000cf542c51003e
challengeType: 5
title: 'Problem 447: Retractions C'
challengeType: 5
forumTopicId: 302119
---
## Description
<section id='description'>
For every integer n>1, the family of functions fn,a,b is defined
by fn,a,b(x)≡ax+b mod n for a,b,x integer and 0<a<n, 0≤b<n, 0≤x<n.
We will call fn,a,b a retraction if fn,a,b(fn,a,b(x))≡fn,a,b(x) mod n for every 0≤x<n.
Let R(n) be the number of retractions for n.
# --description--
For every integer n>1, the family of functions fn,a,b is defined
F(N)=∑R(n) for 2≤n≤N.
F(107)≡638042271 (mod 1 000 000 007).
by fn,a,b(x)≡ax+b mod n for a,b,x integer and 0
F(N)=∑R(n) for 2≤n≤N. F(107)≡638042271 (mod 1 000 000 007).
Find F(1014) (mod 1 000 000 007).
</section>
## Instructions
<section id='instructions'>
# --hints--
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler447()</code> should return 530553372.
testString: assert.strictEqual(euler447(), 530553372);
`euler447()` should return 530553372.
```js
assert.strictEqual(euler447(), 530553372);
```
</section>
# --seed--
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
## --seed-contents--
```js
function euler447() {
@ -51,17 +36,8 @@ function euler447() {
euler447();
```
</div>
</section>
## Solution
<section id='solution'>
# --solutions--
```js
// solution required
```
</section>