freeCodeCamp/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-365-a-huge-binomial-coefficient.english.md

id	challengeType	title
5900f4da1000cf542c50ffec	5	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.

Instructions

Tests

tests:
  - text: <code>euler365()</code> should return 162619462356610300.
    testString: assert.strictEqual(euler365(), 162619462356610300, '<code>euler365()</code> should return 162619462356610300.');

Challenge Seed

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

euler365();

Solution

// solution required