Files

Oliver Eyton-Williams 0bd52f8bd1 Feat: add new Markdown parser (#39800 )

and change all the challenges to new `md` format.

2020-11-27 10:02:05 -08:00

id, title, challengeType, forumTopicId

id	title	challengeType	forumTopicId
5900f4ae1000cf542c50ffbf	Problem 320: Factorials divisible by a huge integer	5	301977

--description--

Let N(i) be the smallest integer n such that n! is divisible by (i!)1234567890

Let S(u)=∑N(i) for 10 ≤ i ≤ u.

S(1000)=614538266565663.

Find S(1 000 000) mod 1018.

--hints--

euler320() should return 278157919195482660.

assert.strictEqual(euler320(), 278157919195482660);

function euler320() {

  return true;
}

euler320();

// solution required