Oliver Eyton-Williams ee1e8abd87

feat(curriculum): restore seed + solution to Chinese (#40683 )

* feat(tools): add seed/solution restore script

* chore(curriculum): remove empty sections' markers

* chore(curriculum): add seed + solution to Chinese

* chore: remove old formatter

* fix: update getChallenges

parse translated challenges separately, without reference to the source

* chore(curriculum): add dashedName to English

* chore(curriculum): add dashedName to Chinese

* refactor: remove unused challenge property 'name'

* fix: relax dashedName requirement

* fix: stray tag

Remove stray `pre` tag from challenge file.

Signed-off-by: nhcarrigan <nhcarrigan@gmail.com>

Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>

2021-01-12 19:31:00 -07:00

741 B

Raw Blame History

id, title, challengeType, forumTopicId, dashedName

id	title	challengeType	forumTopicId	dashedName
5900f5271000cf542c51003a	Problem 443: GCD sequence	5	302115	problem-443-gcd-sequence

--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).

--hints--

euler443() should return 2744233049300770.

assert.strictEqual(euler443(), 2744233049300770);

--seed--

--seed-contents--

function euler443() {

  return true;
}

euler443();

--solutions--

// solution required

741 B Raw Blame History