---
id: 5900f4da1000cf542c50ffec
challengeType: 5
title: 'Problem 365: A huge binomial coefficient'
forumTopicId: 302026
---

## Description
<section id='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,p*q*r) for 1000<p<q<r<5000 and p,q,r prime.
</section>

## Instructions
<section id='instructions'>

</section>

## Tests
<section id='tests'>

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

```

</section>

## Challenge Seed
<section id='challengeSeed'>

<div id='js-seed'>

```js
function euler365() {

  return true;
}

euler365();
```

</div>



</section>

## Solution
<section id='solution'>

```js
// solution required
```

</section>