freeCodeCamp/problem-435-polynomials-of-fibonacci-numbers.chinese.md at 0bbbd16aa9a709a2622a8f22cc6dfb0dcb772fa5

Files

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

1.0 KiB

Raw Blame History

id, challengeType, title, videoUrl, localeTitle

id	challengeType	title	videoUrl	localeTitle
5900f5201000cf542c510032	5	Problem 435: Polynomials of Fibonacci numbers		问题435：斐波那契数的多项式

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！）。

Instructions

Tests

tests:
  - text: <code>euler435()</code>252541322550。
    testString: assert.strictEqual(euler435(), 252541322550);

Challenge Seed

function euler435() {
  // Good luck!
  return true;
}

euler435();

Solution

// solution required

1.0 KiB Raw Blame History Unescape Escape