---
id: 5900f4da1000cf542c50ffec
title: 'Problem 365: A huge binomial coefficient'
challengeType: 5
forumTopicId: 302026
dashedName: 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,p*q*r) for 1000&lt;p&lt;q&lt;r&lt;5000 and p,q,r prime.

# --hints--

`euler365()` should return 162619462356610300.

```js
assert.strictEqual(euler365(), 162619462356610300);
```

# --seed--

## --seed-contents--

```js
function euler365() {

  return true;
}

euler365();
```

# --solutions--

```js
// solution required
```
