55 lines
1.1 KiB
Markdown
55 lines
1.1 KiB
Markdown
---
|
|
id: 5900f52a1000cf542c51003c
|
|
challengeType: 5
|
|
title: 'Problem 445: Retractions A'
|
|
videoUrl: ''
|
|
localeTitle: 'Problema 445: Retracciones A'
|
|
---
|
|
|
|
## Description
|
|
<section id="description"> Para cada entero n> 1, la familia de funciones fn, a, b está definida por fn, a, b (x) ≡ax + b mod n para a, b, x entero y 0 <p> Se le da que ∑ R (c) para c = C (100 000, k), y 1 ≤ k ≤99 999 ≡628701600 (mod 1 000 000 007). (C (n, k) es el coeficiente binomial). </p><p> Encuentre ∑ R (c) para c = C (10 000 000, k), y 1 ≤k≤ 9 999 999. Dé su respuesta módulo 1 000 000 007. </p></section>
|
|
|
|
## Instructions
|
|
undefined
|
|
|
|
## Tests
|
|
<section id='tests'>
|
|
|
|
```yml
|
|
tests:
|
|
- text: <code>euler445()</code> debe devolver 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>
|