freeCodeCamp/problem-435-polynomials-of-fibonacci-numbers.spanish.md at 6db0c1e71b51b8246eec28b5cba5e1a7a766081d

Files

Beau Carnes e3f9dc4b86 feat: add Spanish and language parser

2018-10-11 02:15:05 +05:30

1.1 KiB

Raw Blame History

id, challengeType, title, videoUrl, localeTitle

id	challengeType	title	videoUrl	localeTitle
5900f5201000cf542c510032	5	Problem 435: Polynomials of Fibonacci numbers		Problema 435: Polinomios de los números de Fibonacci

Description

Los números de Fibonacci {fn, n ≥ 0} se definen recursivamente como fn = fn-1 + fn-2 con los casos base f0 = 0 y f1 = 1. Defina los polinomios {Fn, n ≥ 0} como Fn (x) = ∑fixi para 0 ≤ i ≤ n. Por ejemplo, F7 (x) = x + x2 + 2x3 + 3x4 + 5x5 + 8x6 + 13x7, y F7 (11) = 268357683. Sea n = 1015. Encuentre la suma [∑0≤x≤100 Fn (x)] mod 1307674368000 (= 15!).

Instructions

Tests

tests:
  - text: <code>euler435()</code> debe devolver 252541322550.
    testString: 'assert.strictEqual(euler435(), 252541322550, "<code>euler435()</code> should return 252541322550.");'

Challenge Seed

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

euler435();

Solution

// solution required

1.1 KiB Raw Blame History