Generalized Fibonacci Polynomials and some Identities
Author(s) -
G. L. P.,
Omprakash Sikhwal,
Ritu Choudhary
Publication year - 2016
Publication title -
international journal of computer applications
Language(s) - English
Resource type - Journals
ISSN - 0975-8887
DOI - 10.5120/ijca2016911990
Subject(s) - fibonacci number , computer science , fibonacci polynomials , algebra over a field , orthogonal polynomials , discrete mathematics , combinatorics , pure mathematics , mathematics , difference polynomials
The Fibonacci polynomials and Lucas polynomials are famous for possessing wonderful and amazing properties and identities. Generalization of Fibonacci polynomial has been done using various approaches. One usually found in the literature that the generalization is done by varying the initial conditions. In this paper, Generalized Fibonacci polynomials are defined by W n (X)=XW n-1 (X)+W n-2 (X); n≥2 with W 0 (X)=2b and W 1 (X) = a+b, where a and b are integers. Further, some basic identities are generated and
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom