Oliver Eyton-Williams 0bd52f8bd1

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
5900f4da1000cf542c50ffec	Problem 365: A huge binomial coefficient	5	302026

--description--

The binomial coefficient C(1018,109) is a number with more than 9 billion (9×109) digits.

Let M(n,k,m) denote the binomial coefficient C(n,k) modulo m.

Calculate ∑M(1018,109,pqr) for 1000<p<q<r<5000 and p,q,r prime.

--hints--

euler365() should return 162619462356610300.

assert.strictEqual(euler365(), 162619462356610300);

function euler365() {

  return true;
}

euler365();

// solution required