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

56 lines
1.0 KiB
Markdown
Raw Normal View History

---
id: 5900f4da1000cf542c50ffec
challengeType: 5
title: 'Problem 365: A huge binomial coefficient'
videoUrl: ''
localeTitle: 'Problema 365: Um enorme coeficiente binomial'
---
## Description
<section id="description"> O coeficiente binomial C (1018,109) é um número com mais de 9 bilhões (9 × 109) dígitos. <p> Seja M (n, k, m) o 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 e p, q, r primo. </p></section>
## Instructions
<section id="instructions">
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler365()</code> deve retornar 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>