---
id: 5900f5201000cf542c510032
challengeType: 5
title: 'Problem 435: Polynomials of Fibonacci numbers'
videoUrl: ''
localeTitle: 'Problema 435: Polinômios de números de Fibonacci'
---

## Description
<section id="description"> Os números de Fibonacci {fn, n ≥ 0} são definidos recursivamente como fn = fn-1 + fn-2 com casos de base f0 = 0 e f1 = 1. Defina os polinômios {Fn, n ≥ 0} como Fn (x) = ∑fixi para 0 ≤ i ≤ n. Por exemplo, F7 (x) = x + x2 + 2x3 + 3x4 + 5x5 + 8x6 + 13x7 e F7 (11) = 268357683. Seja n = 1015. Encontre a soma [∑0≤x≤100 Fn (x)] mod 1307674368000 (= 15!). </section>

## Instructions
<section id="instructions">
</section>

## Tests
<section id='tests'>

```yml
tests:
  - text: <code>euler435()</code> deve retornar 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>
