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

62 lines
990 B
Markdown
Raw Normal View History

---
id: 5
localeTitle: 5900f4da1000cf542c50ffec
challengeType: 5
title: 'Problem 365: A huge binomial coefficient'
---
## 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.
Sea M (n, k, m) el coeficiente binomial C (n, k) módulo m.
Calcule ∑M (1018,109, p * q * r) para 1000 <p<q<r<5000 and p,q,r prime.<code> 0 </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>