61 lines
987 B
Markdown
61 lines
987 B
Markdown
---
|
||
id: 5900f5201000cf542c510032
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
title: 问题435：斐波那契数的多项式
|
||
---
|
||
|
||
## Description
|
||
<section id="description">
|
||
斐波纳契数{fn，n≥0}被递归定义为fn = fn-1 + fn-2，基本情况为f0 = 0和f1 = 1。
|
||
对于0≤i≤n，将多项式{Fn，n≥0}定义为Fn（x）= ∑fixi。
|
||
例如，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);
|
||
|
||
```
|
||
|
||
</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>
|