For what complex numbers, x, is(adsbygoogle = window.adsbygoogle || []).push({});

G_{n}= f_{n-1}(x) - 2f_{n}(x) + f_{n+1}(x) = 0

where the terms are consecutive Fibonacci polynomials?

Here's what I know:

1) Each individual polynomial, f_{m}, has roots x=2icos(kπ/m), k=1,...,m-1.

2) The problem can be rewritten recursively as

G_{n+2}= xG_{n+1}+ G_{n},

G_{1}= x-2,

G_{2}= x^{2}- 2x + 2

with characteristic equation Y^{2}- xY - 1.

If a and b are the roots of the characteristic equation, then

G_{n}= a^{n}+ b^{n}- 2(a^{n}- b^{n})/(a-b)

Choosing x=-2icosh(z) is an option that leads to an expression in terms of cosh(nx), sinh(nx) and sinh(x) but it doesn't get me any further.

Has anyone got an idea on an alternative approach to this problem?

Does anyone know of previous studies of this type of problem?

Thank you

**Physics Forums | Science Articles, Homework Help, Discussion**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Roots of linear sum of Fibonacci polynomials

**Physics Forums | Science Articles, Homework Help, Discussion**