A MATRIX REPRESENTATION OF A GENERALIZED FIBONACCI POLYNOMIAL

The Fibonacci polynomial Fn(x) defined recurrently by Fn+1(x) = xFn(x)+Fn−1(x), with F0(x) = 0, F1(0) = 1, for n ≥ 1 is the topic of wide interest for many years. In this article, generalized Fibonacci polynomials Fbn+1(x) and Lbn+1(x) are introduced and defined by Fbn+1(x) = xFbn(x)+Fbn−1(x) with F...

Full description

Saved in:
Bibliographic Details
Main Authors: A. D. Godase, M. B. Dhakne
Format: Article
Language:English
Published: Naim Çağman 2017-11-01
Series:Journal of New Theory
Subjects:
Online Access:https://dergipark.org.tr/en/download/article-file/407757
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The Fibonacci polynomial Fn(x) defined recurrently by Fn+1(x) = xFn(x)+Fn−1(x), with F0(x) = 0, F1(0) = 1, for n ≥ 1 is the topic of wide interest for many years. In this article, generalized Fibonacci polynomials Fbn+1(x) and Lbn+1(x) are introduced and defined by Fbn+1(x) = xFbn(x)+Fbn−1(x) with Fb0(x) = 0, Fb1(x) = x 2+4, for n ≥ 1 and Lbn+1(x) = xLbn(x)+Lbn−1(x) with Lb0(x) = 2x 2 + 8, Lb1(x) = x 3 + 4x, for n ≥ 1. Also some basic properties of these polynomials are obtained by matrix methods.
ISSN:2149-1402