pith. sign in

arxiv: 1702.01855 · v2 · pith:HYZHVB4Nnew · submitted 2017-02-07 · 🧮 math.NT

Identities for the generalized Fibonacci polynomial

classification 🧮 math.NT
keywords fibonaccitypelucaspolynomialidentitiesnumberspolynomialsbinet
0
0 comments X
read the original abstract

A second order polynomial sequence is of Fibonacci type (Lucas type) if its Binet formula is similar in structure to the Binet formula for the Fibonacci (Lucas) numbers. In this paper we generalize identities from Fibonacci numbers and Lucas numbers to Fibonacci type and Lucas type polynomials. A Fibonacci type polynomial is equivalent to a Lucas type polynomial if they both satisfy the same recurrence relations. Most of the identities provide relationships between two equivalent polynomials. In particular, each type of identities in this paper relate the following polynomial sequences: Fibonacci with Lucas, Pell with Pell-Lucas, Fermat with Fermat-Lucas, both types of Chebyshev polynomials, Jacobsthal with Jacobsthal-Lucas and both types of Morgan-Voyce.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.