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

---
id: 5900f4da1000cf542c50ffec
challengeType: 5
title: 'Problem 365: A huge binomial coefficient'
videoUrl: ''
localeTitle: 'Problema 365: Un enorme coeficiente binomial'
---

## Description
<section id="description"> El coeficiente binomial C (1018,109) es un número con más de 9 mil millones (9 × 109) dígitos. <p> Sea M (n, k, m) el coeficiente binomial C (n, k) módulo m. </p><p> Calcule ∑M (1018,109, p <em>q</em> r) para 1000 &lt;p &lt;q &lt;r &lt;5000 yp, q, r prime. </p></section>

## Instructions
<section id="instructions">
</section>

## Tests
<section id='tests'>

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

```

</section>

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

<div id='js-seed'>

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

euler365();

```

</div>



</section>

## Solution
<section id='solution'>

```js
// solution required
```
</section>