freeCodeCamp/problem-443-gcd-sequence.english.md at f1c9b08cf322e4268a0a31ae9b5d75bf3cfce7d1

Files

Oliver Eyton-Williams f1c9b08cf3 fix(curriculum): add isHidden: false to challenges

This includes certificates (where it does nothing), but does not
include any translations.

2020-05-25 16:25:19 +05:30

id, challengeType, isHidden, title, forumTopicId

id	challengeType	isHidden	title	forumTopicId
5900f5271000cf542c51003a	5	false	Problem 443: GCD sequence	302115

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.

The first few values are:

n 4567891011121314151617181920... g(n) 1314161718272829303132333451545560...

You are given that g(1 000) = 2524 and g(1 000 000) = 2624152.

Find g(1015).

tests:
  - text: <code>euler443()</code> should return 2744233049300770.
    testString: assert.strictEqual(euler443(), 2744233049300770);

function euler443() {
  // Good luck!
  return true;
}

euler443();

// solution required