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

49
curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-443-gcd-sequence.md
View File

@ -1,49 +1,35 @@
---
id: 5900f5271000cf542c51003a
challengeType: 5
title: 'Problem 443: GCD sequence'
challengeType: 5
forumTopicId: 302115
---
## Description
<section id='description'>
# --description--
Let g(n) be a sequence defined as follows:
g(4) = 13,
g(n) = g(n-1) + gcd(n, g(n-1)) for n > 4.
Let g(n) be a sequence defined as follows: g(4) = 13, g(n) = g(n-1) + gcd(n, g(n-1)) for n > 4.
The first few values are:
n 4567891011121314151617181920...
g(n) 1314161718272829303132333451545560...
n 4567891011121314151617181920... g(n) 1314161718272829303132333451545560...
<!-- TODO Use MathJax -->
You are given that g(1 000) = 2524 and g(1 000 000) = 2624152.
You are given that g(1 000) = 2524 and g(1 000 000) = 2624152.
Find g(1015).
</section>
## Instructions
<section id='instructions'>
# --hints--
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler443()</code> should return 2744233049300770.
testString: assert.strictEqual(euler443(), 2744233049300770);
`euler443()` should return 2744233049300770.
```js
assert.strictEqual(euler443(), 2744233049300770);
```
</section>
# --seed--
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
## --seed-contents--
```js
function euler443() {
@ -54,17 +40,8 @@ function euler443() {
euler443();
```
</div>
</section>
## Solution
<section id='solution'>
# --solutions--
```js
// solution required
```
</section>