Turkish Journal of Analysis and Number Theory, 2013, Vol. 1, No.

1, 43-47
Available online at http://pubs.sciepub.com/tjant/1/1/9
© Science and Education Publishing
DOI:10.12691/tjant-1-1-9

Generalized Fibonacci Polynomials

Yashwant K. Panwar1,*, B. Singh2, V.K. Gupta3
1
Mandsaur Institute of Technology, Mandsaur, India
2
School of Studies in Mathematics, Vikram University, Ujjain, India
3
Govt. Madhav Science College, Ujjain, India
*Corresponding author: [email protected]
Received August 22, 2013; Revised October 24, 2013; Accepted November 10, 2013
Abstract In this study, we present generalized Fibonacci polynomials. We have used their Binet’s formula and
generating function to derive the identities. The proofs of the main theorems are based on special functions, simple
algebra and give several interesting properties involving them.
Keywords: generalized Fibonacci polynomials, Binet’s formula, generating function
Cite This Article: Yashwant K. Panwar, B. Singh, and V.K. Gupta, “Generalized Fibonacci Polynomials.”
Turkish Journal of Analysis and Number Theory 1, no. 1 (2013): 43-47. doi: 10.12691/tjant-1-1-9.

Lucas sequences. That is f n (1) = Fn and ln (1) = Ln ,

1. Introduction where Fn and Ln are the Fibonacci and Lucas numbers.
Swamy [11] defined the Fibonacci Polynomials and
Fibonacci polynomials are a great importance in obtained some more identities for these polynomials.
mathematics. Large classes of polynomials can be defined Hogget and Lind [17] make a similar “symbolic
by Fibonacci-like recurrence relation and yield Fibonacci substitution” of certain sequences into the Fibonacci
numbers [15]. Such polynomials, called the Fibonacci polynomials, they extend these results to the substitution
polynomials, were studied in 1883 by the Belgian of any recur rent sequence into any sequence of
Mathematician Eugene Charles Catalan and the German polynomials obeying a recurrence relation with
Mathematician E. Jacobsthal. polynomial coefficients. Since then many problems about
The polynomials f n ( x ) studied by Catalan are defined the polynomials have been proposed in various issue of
the Fibonacci Quarterly. Hoggatt, Philips and Leonard [16]
by the recurrence relation
have obtained some more identities involving Fibonacci
Polynomials and Lucas polynomials. A. Lupas [3] present
n + 2 ( x ) xf n +1 ( x ) + f n ( x )
f= (1.1)
many interesting properties of Fibonacci and Lucas
where f1 ( x ) = 1 , f 2 ( x ) = x , and n ≥ 3 . Notice Polynomials. C. Berg [4] defined Fibonacci numbers and
orthogonal polynomials. S. Falcon and A. Plaza [13]
that f n (1) = F , the nth Fibonacci number. defined the k-Fibonacci polynomials are the natural
The Fibonacci polynomials studied by Jacobsthal were extension of the k-Fibonacci numbers and many of their
defined by properties admit a straightforward proof and many
relations for the derivatives of Fibonacci polynomials are
J n ( x ) J n −1 ( x ) + xJ n − 2 ( x )
= (1.2) proven. K. Kaygisiz and A. Sahin [10] present new
generalizations of the Lucas numbers by matrix
where J1 ( x )= 1= J 2 ( x ) , and n ≥ 3 . representation, using Generalized Lucas Polynomials. G.
Y. Lee and M. Asci [8], consider the Pascal matrix and
The Pell polynomials pn ( x ) are defined by
define a new generalization of Fibonacci polynomials
called (p, q)-Fibonacci polynomials. They obtain
pn ( x ) 2 xpn −1 ( x ) + pn − 2 ( x )
= (1.3) combinatorial identities and by using Riordan method they
get a factorizations of Pascal matrix involving (p, q)-
where p0 ( x ) = 0 , p1 ( x ) = 1 , and n ≥ 2 . Fibonacci polynomials. Many authors have studied
The Lucas polynomials ( ) nl x , originally studied in Fibonacci polynomials. In this paper, we present
1970 by Bicknell, are defined by generalization of Fibonacci and Lucas Polynomials by
changing the initial terms but the recurrence relation is
ln ( x ) xln −1 ( x ) + ln − 2 ( x )
= (1.4) preserved.

where l0 ( x ) = 2 , l1 ( x ) = x , and n ≥ 2 .
It is well known that the Fibonacci polynomials and 2. Generalized Fibonacci Polynomials
Lucas polynomials are closely related. Obviously, they
have a deep relationship with the famous Fibonacci and The generalized Fibonacci polynomials defined by
 44 Turkish Journal of Analysis and Number Theory

 s if n = 0  Proof: Since ℜ1 & ℜ2 are the roots of the

  characteristic equation (2.3), then
=f n +1 ( x ) = sx if n 1  (2.1)
 xf ( x ) + f ( x ) if n ≥ 2 
 n n −1  ℜ11 = xℜ1 + 1
If s=1, then we obtained classical Fibonacci polynomial ℜ22 = xℜ2 + 2
sequence.
It is well known that the Fibonacci polynomials and now, multiplying both sides of these equations by
Lucas Polynomials are closely related. The ℜ1n & ℜ2n respectively, we obtain the desired result.
generalized Lucas polynomials defined by Proposition 4: For any integer n ≥ 1,

=


ln ( x ) =
2s
sx
if n = 0 
if n 1 

(2.2)
(
s ℜ1n =
+ ℜn2 )
f n +1 ( x ) + f n −1 ( x ) (3.5)

 xl ( x ) + l 
 n −1 n − 2 ( x ) if n ≥ 2  Proof: By using Eq. (3.1) in the R.H.S. of Eq. (3.5) and
−1
If s=1, then we obtained classical Lucas polynomial taking in to account that ℜ1 = it is obtained
ℜ2
sequence.
In the 19th century, the French mathematician Binet
ℜn +1 − ℜn2 +1 ℜn −1 − ℜn2 −1
devised two remarkable analytical formulas for the= ( RHS ) s 1 +s 1
Fibonacci and Lucas numbers. In our case, Binet’s ℜ1 − ℜ2 ℜ1 − ℜ2
formula allows us to express the generalized Fibonacci
Polynomials in function of the roots ℜ1 & ℜ2 of the
=
s
ℜ1 − ℜ2
ℜ1n +1 + ℜ1n −1 − ℜn2 +1 − ℜn2 −1 ( )
following characteristic equation, associated to the  n 
s 1  n 1  
recurrence relation (2.1) & (2.2): = ℜ1  ℜ1 +  − ℜ2  ℜ2 + 
ℜ1 − ℜ2   ℜ1   ℜ2  
2
x = xt + 1 (2.3)
= s ℜ1n + ℜn2 ( )
3. Properties of Generalized Fibonacci Proposition 5: For any integer n,
Polynomials
( ) ; if n is even (3.6)
 2 n n 2
 s ℜ1 + ℜ2
Theorem 1: (Binet's formula). The nth generalized
(x 2
+4 ) f n2 2
( x ) + 4s ( −1) n
=
( ) ; if n is odd
2
 s 2 ℜn − ℜn
Fibonacci Polynomials is given by  1 2

ℜ1n − ℜ2n Proof: From the Binet’s formula of generalized

fn ( x ) = s (3.1) Fibonacci Polynomials
ℜ1 − ℜ2
where are the roots of the characteristic equation (3),
2 2
f n2 ( x )
=
( ℜ1 − ℜ2 )
s2
2 {ℜ
2n
1
n
− 2 ( ℜ1ℜ2 ) + ℜ22n }
x+ x +4 x− x +4
ℜ1 > ℜ2 and ℜ1 = and ℜ2 = .
( ) ( sℜ1n + sℜn2 )
2 2 2
If n is even, x 2 + 4 f n2 ( x ) + 4 s 2 =
Proof: we use the Principle of Mathematical Induction
(PMI) on n. It is clear the result is true for n = 0 and n = 1
( ) ( sℜ1n − sℜ2n )
2
by hypothesis. Assume that it is true for i such that 0 ≤ i ≤ If n is odd, x 2 + 4 f n2 ( x ) − 4 s 2 =
r +1, then
ℜ1i − ℜi2
Let us denote sℜ1n + sℜn2 ( ) by ln ( x ) .
fi ( x ) = s Then previous formula become:
ℜ1 − ℜ2
It follows from definition of generalized Fibonacci ( x2 + 4) fn2 ( x ) + 4s2 ( −1)n =
ln2 ( x ) (3.7)
Polynomials and from equation (3.1),

ℜ1r + 2 − ℜ2r + 2
f r + 2 ( x )= xft +1 ( x ) + f r ( x )= s (3.2) 4. Sums of Generalized Fibonacci
ℜ1 − ℜ2
Polynomials
Thus, the formula is true for any positive integer n.
Theorem 2: (Binet's formula). The nth generalized In this section, we study the sums of generalized
Lucas Polynomials is given by Fibonacci Polynomials. This enables us to give in a
straightforward way several formulas for the sums of such
(
ln ( x )= s ℜ1n + ℜn2 ) (3.3) Polynomials.
Lemma 6: For fixed integers p, q with 0 ≤ q ≤ p − 1 ,
Proposition 3: For any integer n ≥ 1,
the following equality holds
ℜ1n + 2 = xℜ1n +1 + ℜ1n p
sf p( n + 2 ) ( x ) l p ( x ) f p( n +1)+ q ( x ) − ( −1) sf pn + q ( x ) (3.8)
(3.4) =
ℜ2n + 2 = xℜ2n +1 + ℜ2n
 Turkish Journal of Analysis and Number Theory 45

Proof: From the Binet’s formula of generalized n f3n +5 ( x ) + f3n + 2 ( x ) − s − sx

(iii) For q=2: ∑ f3i + 2 ( x ) =
Fibonacci and Lucas Polynomials,
i =0 sx 2 + s
l p ( x ) f p( n +1)+ q ( x ) (2) If m=2 then p=5
 ℜ p( n +1)+ q p ( n +1) + q
− ℜ2  n q
f5n + q +5 ( x ) + f5n + q ( x ) − f q ( x ) − ( −1) f5− q ( x )
(
= s ℜ1n + ℜn2 s )  1  ∑ f5i + q ( x ) = (3.13)
 ℜ1 − ℜ2  i =0 sx5 + 5sx3 + 5sx
 

=
s2 ℜ p( n + 2 )+ q + ( −1) p ℜ pn + q − ( −1) p ℜ pn + q − ℜ p( n + 2 )+ q 
(i) For q=0:
n (
f5n +5 ( x ) + f5n ( x ) − sx 4 + 3sx 2 + s )
ℜ1 − ℜ2  1 1 2 2  ∑ f5i ( x ) =
sx5 + 5sx3 + 5sx
i =0

=
s2
ℜ1 − ℜ2  1 {
ℜ p( n + 2 )+ q − ℜ p( n + 2 )+ q  + ( −1) p ℜ pn + q − ℜ pn + q
2  1 2 ( )} n
(ii) For q=1: ∑ f5i +1 ( x ) =
i =0
f5n + 6 ( x ) + f5n +1 ( x ) + sx3 + 2 sx − s
sx5 + 5sx3 + 5sx
p
= sf p( n + 2 ) ( x ) + ( −1) sf pn + q ( x )
(iii) For q=2: ∑ f ( x ) =
n (
f5n + 7 ( x ) + f5n + 2 ( x ) − sx 2 + sx + s )
5i + 2 5 3
then, the equation becomes, i =0 sx + 5sx + 5sx

p
n
(iv) For q=3: ∑ f5i +3 ( x ) = (
f5n +8 ( x ) + f5n +3 ( x ) − sx 2 − sx + s )
sf p( n + 2 ) ( x ) l p ( x ) f p( n +1)+ q ( x ) − ( −1) sf pn + q ( x )
=
i =0 sx5 + 5sx3 + 5sx
Proposition 7: For fixed integers p, q with (v) For q=4: ∑ f ( x ) =
n (
f5n +9 ( x ) + f5n + 4 ( x ) − sx3 + 2 sx + s )
0 ≤ q ≤ p − 1 , the following equality holds 5i + 4
i =0 sx5 + 5sx3 + 5sx
Corollary 7.2: Sum of even generalized Fibonacci
(3.9)
p p
n f p( n +1)+ q ( x ) − f q ( x ) − ( −1) f pn + q ( x ) − ( −1) f p − q ( x )
∑ f pi + q ( x ) = p
polynomials
i =0 l p ( x ) − ( −1) − 1 If p=2m, then Eq.(3.9) is
Proof: Applying Binet’s formula of generalized n
q
f 2m( n +1)+ q ( x ) + f 2mn + q ( x ) − f q ( x ) − ( −1) f 2m − q ( x ) (3.14)
Fibonacci Polynomials, ∑ f2mi + q ( x ) = l2m ( x ) − 2
i =0
n
∑ f pi + q ( x ) For example
i =0 (1) If m=1 then p=2
n ℜ1pi + q − ℜ2pi + q
= s∑ q
n f 2n + 2+ q ( x ) + f 2n + q ( x ) − f q ( x ) − ( −1) f 2− q ( x )
i =0 ℜ1 − ℜ2
∑ f 2i + q ( x ) = (3.15)
s  n pi + q n pi + q  i =0 sx 2 + 2 s − 2
=  ∑ ℜ1 − ∑ ℜ2 
ℜ=
1 − ℜ2  i 0=i 0  n f 2n + 2 ( x ) − f 2n ( x ) − sx
s  ℜ pn + q + p − ℜq ℜ pn + q + p − ℜq  (i) For q=0: ∑ f 2i ( x ) =
 1
sx 2 + 2 s − 2
1
− 2 2 
ℜ1 − ℜ2  ℜ p
− 1 ℜ p
− 1  i =0
 1 2 
s n f 2n +3 ( x ) − f 2n +1 ( x ) − sx
( −1) p f
(ii) For q=1: ∑ f 2i +1 ( x ) =
q 
= pn + q ( x ) − f p ( n +1) + q ( x ) + f q ( x ) + ( −1) f p − q ( x ) 
( −1) p − l p ( x ) + 1  sx 2 + 2 s − 2
i =0
p q
f p( n +1)+ q ( x ) − f q ( x ) − ( −1) f pn + q ( x ) − ( −1) f p − q ( x ) n f 2n + 4 ( x ) − f 2n + 2 ( x ) − sx
∑ f 2i + 2 ( x ) =
=
l p ( x ) − ( −1) − 1
p (iii) For q=2:
i =0 sx 2 + 2 s − 2
Corollary 7.1: Sum of odd generalized Fibonacci (2) If m=2 then p=4
polynomials q
If p=2m+1, then Eq.(3.9) is
n f 4n + 4+ q ( x ) + f 4n + q ( x ) − f q ( x ) − ( −1) f 4− q ( x ) (3.16)
∑ f 4i + q ( x ) = sx 4 + 4 sx 2 + 2 s − 2
n
q
f( 2m +1)( n +1)+ q ( x ) + f( 2m +1)n + q ( x ) − f q ( x ) − ( −1) f( 2m +1)− q ( x ) (3.10) i =0
∑ f( 2m+1)i + q ( x ) =
i =0 l2m +1 ( x ) n f 4n + 4 ( x ) − f 4n ( x ) − sx3 − 2 sx
For example
(i) For q=0: ∑ f 4i ( x ) = sx 4 + 4 sx 2 + 2 s − 2
i =0
(1) If m=0 then p=1 n f 4n +5 ( x ) − f 4n +1 ( x ) + sx 2
n f n + q +1 ( x ) + f n + q ( x ) − f q ( x ) − ( −1) f1− q ( x )
q (ii) For q=1: ∑ f4i +1 ( x ) = sx 4 + 4 sx 2 + 2 s − 2
∑ fi + q ( x ) = (3.11) i =0
sx
i =0 n f 4n + 6 ( x ) − f 4n + 2 ( x ) − sx
n f n +1 ( x ) + f n ( x ) − s
(iii) For q=2: ∑ f 4i + 2 ( x ) = sx 4 + 4 sx 2 + 2 s − 2
(i) For q=0: ∑ fi ( x ) =
sx
i =0
n f 4n + 7 ( x ) − f 4n +3 ( x ) − sx 2
i =0 (iv) For q=3:
(2) If m=0 then p=3
∑ f 4i + 3 ( x ) = sx 4 + 4 sx 2 + 2 s − 2
i =0
n f3n + q +3 ( x ) + f3n + q ( x ) − f q ( x ) − ( −1) f3− q ( x )
q n f 4n +8 ( x ) − f 4n + 4 ( x ) − sx3 − 2 sx
(3.12) (v) For q=4: ∑ f 4i + 4 ( x ) =
∑ f3i + q ( x ) =
sx3 + 3sx i =0 sx 4 + 4 sx 2 + 2 s − 2
i =0
(3) If m=3 then p=6
n f3n +3 ( x ) + f3n ( x ) − f3− q ( x )
(i) For q=0: ∑ f3i ( x ) = sx 2 + s
n
∑ f 6i + q ( x ) =
q
f 6n + 6+ q ( x ) − f 6n + q ( x ) − f q ( x ) − ( −1) f 6− q ( x )
(3.17)
i =0
i =0 sx 6 + 6 sx 4 + 9 sx 2 + 2 s − 2
n f3n + 4 ( x ) + f3n +1 ( x ) − s + sx
(ii) For q=1: ∑ f3i +1 ( x ) = sx 2 + s
i =0
46 Turkish Journal of Analysis and Number Theory

n f 6n + 6 ( x ) − f 6n ( x ) − sx 6 − 6 sx 4 − 9 sx 2 − 2 s ∞
tn
(i) For q=0: ∑ f ( x ) =
6i
i =0
6 4
sx + 6 sx + 9 sx + 2 s − 2 2
(ii) ∑ ln ( x ) n ! = δ se xt1Fo ( n + 1, −, t 2 ) , where δ = 2 − xt (4.2)
n =0
n f 6n + 7 ( x ) − f 6n +1 ( x ) + sx 4 + 3sx 2
(ii) For q=1: ∑ f 6i +1 ( x ) = (iii) ln ( x ) 2 f n +1 ( x ) − xf n ( x )
= (4.3)
i =0 sx 6 + 6 sx 4 + 9 sx 2 + 2 s − 2
n f 6n +8 ( x ) − f 6n + 2 ( x ) + sx 4 + 3sx 2 (iv) ln +1 ( x ) xf n +1 ( x ) + 2 xf n ( x )
= (4.4)
(iii) For q=2: ∑ f 6i + 2 ( x ) = 6 4 2
sx + 6 sx + 9 sx + 2 s − 2
i =0 Proof (i): Since the generating function of the
n f 6n +9 ( x ) − f 6n +3 ( x ) generalized Fibonacci Polynomials is,
(iv) For q=3: ∑ f6i +3 ( x ) = sx6 + 6sx4 + 9sx2 + 2s − 2 ∞
( )
i =0 −1
Proposition 8: For fixed integers p, q with ∑ fn ( x ) t n−1 = s 1 − xt − t 2
0 ≤ q ≤ p − 1 , the following equality holds n =0
∞
n
n
i = s ∑ tn ( x + t )
∑ ( −1) f pi + q ( x ) =
n =0
i =0

( −1) p f p( n +1)+ q ( x ) + ( −1)

n+ p
f pn + q ( x ) + ( −1)
q +1
f p −q ( x ) + fq ( x ) ∞ n
p
= s ∑ t n ∑ t r x n − r n Cr
l p ( x ) + ( −1) + 1
=n 0=r 0
(3.18) ∞ n n+ r n−r
t x n!
Proof: Applying Binet’s formula of generalized = s∑ ∑
n
= 0=r 0 r !( n − r ) !
Fibonacci Polynomials, the proof is clear. For different
values of p&q: ∞ ∞ t n + 2r x n ( n + r )!
= s∑ ∑
n
i ( −1)n f n+1 ( x ) − ( −1)n fn ( x ) − s r !n !
(i) ∑ ( −1) f i ( x ) =
sx
n 0=r 0
=
i =0 ∞
( xt )n
t 2r ∞
n n = s∑ ∑ n !( n + 1)r
n
i ( −1) f 2n+ 2 ( x ) + ( −1) f 2n ( x ) − sx n! r 0 r !
(ii) ∑ ( −1) f 2i ( x ) =
sx 2 + 2 s + 2
=n 0=
i =0 ∞
t n −1
n
(iii) ∑ ( −1) f 2i +1 ( x ) =
i ( −1)n
f 2n +3 ( x ) + ( −1) f 2n +1 ( x ) − sx
n
∑ fn (=
n =0
x)
n!
(
se xt 1F0 n + 1, −, t 2 )
i =0 sx 2 + 2 s + 2
n n n
( −1) f 4n+ 4 ( x ) + ( −1) f 4n ( x ) − sx3 − 2sx Proof (ii): Since the generating function of the
(iv) ∑ ( −1)
i
f 4i ( x ) = generalized Lucas Polynomials is,
i =0 sx 4 + 4 sx 2 + 2 s + 2
∞
( )
n n −1
n
( −1) f 4n+5 ( x ) + ( −1) f 4n+1 ( x ) + sx 2 + 2s
(v) ∑ ( −1)
i =0
i
f 4i +1 ( x ) =
sx 4 + 4 sx 2 + 2 s + 2
∑ ln ( x ) t n= δ s 1 − xt − t 2
n =0
n
(vi) ∑ ( −1)i f 4i + 2 ( x ) = ( −1)n
f 4n + 6 ( x ) + ( −1) f 4n + 2 ( x )
n
∞
n
= δ s ∑ tn ( x + t )
i =0 sx 4 + 4 sx 2 + 2 s + 2
n =0
n n
n
(vii) ∑ ( −1)i ( −1) f 4n+7 ( x ) + ( −1) f 4n+3 ( x ) + sx 2 + 2s ∞ n
f 4i + 3 ( x ) =
i =0 sx 4 + 4 sx 2 + 2 s + 2 = δ s ∑ t n ∑ t r x n − r n Cr
=n 0=r 0
∞ n n+ r n−r
t x n!
5. Confluent Hypergeometric Identities of =δs∑ ∑
0=r 0 r !( n − r ) !
Generalized Fibonacci Polynomials n
=
∞ ∞ t n + 2r x n ( n + r )!
A. Lupas [3], present a guide of Fibonacci and Lucas ∑ =δs∑
=n 0=r 0 r !n !
Polynomial and defined Fibonacci and Lucas Polynomial
∞ xt n ∞ 2 r
in terms of hypergeometric form. K. Dilcher [9], defined ( ) t
Fibonacci numbers in terms of hypergeometric function. C. = δ s ∑ n ! ∑ r ! n !( n + 1)r
Berg [4], defined Fibonacci numbers and orthogonal = n 0=r 0
polynomials. ∞
tn
In this section, we established some properties of
generalized Fibonacci Polynomials in terms of confluent
∑=
n =0
ln ( x )
n!
δ se xt 1F0 n + 1, −, t 2 ( )
hypergeometric function. Proofs of the theorem are based
We can easily get the following recurrence relation by
on special function, simple algebra and give several
using (4.1) and (4.2)
interesting identities involving them.
(iii)
= ln ( x ) 2 f n +1 ( x ) − xf n ( x )
Theorem 9: If f n ( x ) and ln ( x ) are generalized
Fibonacci and Lucas Polynomials then (iv) =ln +1 ( x ) xf n +1 ( x ) + 2 xf n ( x )
Theorem 10: If f n ( x ) and ln ( x ) are generalized
∞
t n −1
(i) ∑
n =0
f n ( x=
)
n!
se xt1Fo n + 1, −, t 2 ( ) (4.1) Fibonacci and Lucas Polynomials then
 Turkish Journal of Analysis and Number Theory 47

f n +1 ( x )  l ( x )  identities of generalized Fibonacci and Lucas polynomials.

(i) ( n + 1) ∫ log c  n +1
dx =  (4.5) In Theorem: 10 we use c, is the arbitrary constants of
ln +1 ( x )  s  integration and give several interesting identities involving
them.
e n +1( )
l x
l 1( x )
(ii) ∫ f n +1 ( x ) e n += dx +c (4.6)
n +1
1
References
(iii) ∫ f n +1 ( x ) ln +1 ( x ) dx = 0 (4.7) [1] A. F. Horadam, “Extension of a synthesis for a class of
−1 polynomial sequences,” The Fibonacci Quarterly, vol. 34; 1966,
no. 1, 68-74.
Generating functions are very helpful in finding of [2] Nalli and P. Haukkanen, “On generalized Fibonacci and Lucas
relations for sequences of integers. Some authors found polynomials,” Chaos, Solitons and Fractals, vol. 42; 2009, no. 5,
miscellaneous identities for the Fibonacci polynomials 3179-3186.
and Lucas polynomials by manipulation with their [3] Alexandru Lupas, A Guide of Fibonacci and Lucas Polynomial,
Octagon Mathematics Magazine, vol. 7(1); 1999, 2-12.
generating functions. Our approach is rather different in [4] Christian Berg, Fibonacci numbers and orthogonal polynomials,
this section. Arab Journal of Mathematical Sciences, vol.17; 2011, 75-88.
Corollary 10.1: [5] E. Artin, Collected Papers, Ed. S. Lang and J. T. Tate, New York,
springer-Vaerlag, 1965.
∞ S (1 + t ) [6] E. D. Rainville, Special Function, Macmillan, New York, 1960.
∑ { fn ( x ) + fn+1 ( x )} t n =2 (4.8)
n =0 (
t 1 − xt − t ) [7] G. S. Cheon, H. Kim, and L. W. Shapiro, “A generalization of
Lucas polynomial sequence,” Discrete Applied Mathematics, vol.
157; 2009, no. 5, 920-927.
Corollary 10.3: [8] G. Y. Lee and M. Asci, Some Properties of the (p, q)-Fibonacci
and (p, q)-Lucas Polynomials, Journal of Applied Mathematics,
∞ 2 s (1 − xt + t ) Vol. 2012, Article ID 264842, 18 pages, 2012.
∑ {ln ( x ) + ln+1 ( x )} t n =2 (4.9) [9] Karl Dilcher, “Hypergeometric functions and Fibonacci numbers”,
n =0 (
t 1 − xt − t ) [10]
The Fibonacci Quarterly, vol. 38; 2000, no. 4, 342-363.
K. Kaygisiz and A. Sahin, New Generalizations of Lucas Numbers,
Gen. Math. Notes, Vol. 10; 2012, no. 1, 63-77.
Proposition 11: Prove that
[11] M. N. S. Swamy, “Problem B – 74”, The Fibonacci Quarterly,
∞ st ( 2 − xt ) vol. 3; 1965, no. 3, 236.
∑ (1 + n ) t n fn ( x ) =2 2 (4.10) [12] N. Robbins, Vieta's triangular array and a related family of
n =0
(
1 − xt − t ) polynomials, Internat. J. Mayth. & Math. Sci., Vol. 14; 1991, no. 2,
239-244.
[13] S. Falcon and A. Plaza, On k-Fibonacci sequences and
Proof: Using the generating function, the proof is clear. polynomials and their derivatives, Chaos, Solitons and Fractals 39;
2009. 1005-1019.
[14] S. Vajda, Fibonacci & Lucas numbers, and the Golden Section.
6. Conclusion [15]
Theory and applications, Chichester: Ellis Horwood, 1989.
T. Koshy, Fibonacci and Lucas Numbers with Applications,
Toronto, New York, NY, USA, 2001.
We have derived many fundamental properties in this [16] V. E. Hoggatt, Jr., Leonard, H. T. Jr. and Philips, J. W., Twenty
paper. We describe sums of generalized Fibonacci four Master Identities, The Fibonacci Quarterly, Vol. 9; 1971, no.
Polynomials. This enables us to give in a straightforward 1, 1-17.
way several formulas for the sums of such Polynomials. [17] V. E. Hoggatt, Jr. and D. A. Lind, Symbolic Substitutions in to
Fibonacci Polynomials, The Fibonacci Quarterly, Vol. 6; 1968, no.
These identities can be used to develop new identities of 5, 55-74.
polynomials. Also we describe some confluent hypergeometric