703 B
703 B
id | title | challengeType | forumTopicId | dashedName |
---|---|---|---|---|
5900f4da1000cf542c50ffec | Problem 365: A huge binomial coefficient | 5 | 302026 | problem-365-a-huge-binomial-coefficient |
--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);
--seed--
--seed-contents--
function euler365() {
return true;
}
euler365();
--solutions--
// solution required