Files
freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-435-polynomials-of-fibonacci-numbers.chinese.md
Kristofer Koishigawa b3213fc892 fix(i18n): chinese test suite (#38220)
* fix: Chinese test suite

Add localeTiltes, descriptions, and adjust test text and testStrings to get the automated test suite working.

* fix: ran script, updated testStrings and solutions
2020-03-03 18:49:47 +05:30

61 lines
1.0 KiB
Markdown
Raw Blame History

This file contains ambiguous Unicode characters

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

---
id: 5900f5201000cf542c510032
challengeType: 5
title: 'Problem 435: Polynomials of Fibonacci numbers'
videoUrl: ''
localeTitle: 问题435斐波那契数的多项式
---
## Description
<section id="description">
斐波纳契数{fnn≥0}被递归定义为fn = fn-1 + fn-2基本情况为f0 = 0和f1 = 1。
对于0≤i≤n将多项式{Fnn≥0}定义为Fnx= ∑fixi。
例如F7x= x + x2 + 2x3 + 3x4 + 5x5 + 8x6 + 13x7而F711= 268357683。
令n =1015。求和[∑0≤x≤100 Fnx] 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>