freeCodeCamp/curriculum/challenges/portuguese/08-coding-interview-prep/project-euler/problem-445-retractions-a.p...

56 lines
1.1 KiB
Markdown
Raw Normal View History

---
id: 5900f52a1000cf542c51003c
challengeType: 5
title: 'Problem 445: Retractions A'
videoUrl: ''
localeTitle: ''
---
## Description
<section id="description"> Para cada inteiro n&gt; 1, a família de funções fn, a, b é definida por fn, a, b (x) ≡ax + b mod n para a, b, x inteiro e 0 <p> Você está dado que ∑ R (c) para c = C (100 000, k), e 1 ≤ k ≤ 99 999 ≡ 628701600 (mod 1 000 000 007). (C (n, k) é o coeficiente binomial). </p><p> Encontre ∑ R (c) para c = C (10 000 000, k) e 1 ≤ k≤ 9 999 999. Dê a sua resposta modulo 1 000 000 007. </p></section>
## Instructions
<section id="instructions">
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler445()</code> deve retornar 659104042.
testString: 'assert.strictEqual(euler445(), 659104042, "<code>euler445()</code> should return 659104042.");'
```
</section>
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
```js
function euler445() {
// Good luck!
return true;
}
euler445();
```
</div>
</section>
## Solution
<section id='solution'>
```js
// solution required
```
</section>