56 lines
1.2 KiB
Markdown
56 lines
1.2 KiB
Markdown
|
---
|
|||
|
|
id: 5900f5201000cf542c510032
|
|||
|
|
challengeType: 5
|
|||
|
|
title: 'Problem 435: Polynomials of Fibonacci numbers'
|
|||
|
|
videoUrl: ''
|
|||
|
|
localeTitle: 'Задача 435: Полиномы чисел Фибоначчи'
|
|||
|
|
---
|
|||
|
|
|
|||
|
|
## Description
|
|||
|
|
<section id="description"> Числа Фибоначчи {fn, n ≥ 0} определяются рекурсивно как fn = fn-1 + fn-2 с базовыми случаями f0 = 0 и f1 = 1. Определим многочлены {Fn, n ≥ 0} как Fn (x) = Σfixi для 0 ≤ i ≤ n. Например, F7 (x) = x + x2 + 2x3 + 3x4 + 5x5 + 8x6 + 13x7 и F7 (11) = 268357683. Пусть n = 1015. Найдите сумму [Σ0≤x≤100 Fn (x)] mod 1307674368000 (= 15!). </section>
|
|||
|
|
|
|||
|
|
## Instructions
|
|||
|
|
<section id="instructions">
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Tests
|
|||
|
|
<section id='tests'>
|
|||
|
|
|
|||
|
|
```yml
|
|||
|
|
tests:
|
|||
|
|
- text: <code>euler435()</code> должен вернуть 252541322550.
|
|||
|
|
testString: 'assert.strictEqual(euler435(), 252541322550, "<code>euler435()</code> should return 252541322550.");'
|
|||
|
|
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Challenge Seed
|
|||
|
|
<section id='challengeSeed'>
|
|||
|
|
|
|||
|
|
<div id='js-seed'>
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
function euler435() {
|
|||
|
|
// Good luck!
|
|||
|
|
return true;
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
euler435();
|
|||
|
|
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
</div>
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Solution
|
|||
|
|
<section id='solution'>
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
// solution required
|
|||
|
|
```
|
|||
|
|
</section>
|