For what complex numbers, x, is
Gn = fn-1(x) - 2fn(x) + fn+1(x) = 0
where the terms are consecutive Fibonacci polynomials?
Here's what I know:
1) Each individual polynomial, fm, has roots x=2icos(kπ/m), k=1,...,m-1.
2) The problem can be rewritten recursively as
Gn+2 = xGn+1 +...