See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/269761712

Formulas for binomial sums including powers of Fibonacci and Lucas numbers

Article  in  UPB Scientific Bulletin, Series A: Applied Mathematics and Physics · January 2015

CITATIONS READS

9 194

4 authors:

Emrah Kılıç Ilker Akkus

TOBB University of Economics and Technology Kirikkale University
148 PUBLICATIONS   1,284 CITATIONS    28 PUBLICATIONS   126 CITATIONS   

SEE PROFILE SEE PROFILE

Neşe Ömür Yucel Turker Ulutas

Kocaeli University Kocaeli University
62 PUBLICATIONS   119 CITATIONS    27 PUBLICATIONS   73 CITATIONS   

SEE PROFILE SEE PROFILE

Some of the authors of this publication are also working on these related projects:

Combinatorial Matrices View project

research project View project

All content following this page was uploaded by Emrah Kılıç on 21 December 2014.

The user has requested enhancement of the downloaded file.

U.P.B. Sci. Bull., Series A, Vol. ??, Iss. ?, ???? ISSN 1223-7027

FORMULAS FOR BINOMIAL SUMS INCLUDING POWERS

OF FIBONACCI AND LUCAS NUMBERS

Emrah KILIÇ1 , Ilker AKKUS2 , Neşe ÖMÜR, Yücel Türker ULUTAŞ3

Recently Prodinger [3] proved general expansion formulas for sums

of powers of Fibonacci and Lucas numbers. In this paper, we will prove
general expansion formulas for binomial sums of powers of Fibonacci and
Lucas numbers.

Keywords: Fibonacci and Lucas numbers, binomial sums, powers.

MSC2010: 11B39, 05A19.

1. Introduction
The Fibonacci numbers Fn and Lucas numbers Ln are defined by the
following recursions: for n > 0,
Fn+1 = Fn + Fn−1 and Ln+1 = Ln + Ln−1 ,
where F0 = 0, F1 = 1 and L0 = 2, L1 = 1, respectively.
If the roots of the characteristic equation x2 − x − 1 = 0 are α and β,
then the Binet formulas for them are
αn − β n
Fn = and Ln = αn + β n .
α−β
Wiemann and Cooper [5] mentioned about some conjectures of Melham for
the sum:
Xn
2m+1
F2k .
k=1

Ozeki [2] considered Melham’s sum and then he gave an explicit expansion for
Melham’s sum as a polynomial in F2n+1 .

1
TOBB Economics and Technology University, Mathematics Department, 06560 Ankara,
Turkey, e-mail: ekilic@etu.edu.tr
2
Kırıkkale University, Faculty of Arts and Sciences, Department of Mathematics, 71450
Yahsihan, Kırıkkale, Turkey, e-mail: iakkus.tr@gmail.com
3
Kocaeli University, Department of Mathematics, 41380 Izmit, Turkey, e-mail:
neseomur@kocaeli.edu.tr, turkery@kocaeli.edu.tr

1
2 Emrah KILIÇ, Ilker AKKUS, Neşe ÖMÜR, Yücel Türker ULUTAŞ

In general, Prodinger [3] derived the general formula for the sum:
n
X
2m+ε
F2k+δ ,
k=0

where ε, δ ∈ {0, 1}, as well as the evaluations of the corresponding sums for
Lucas numbers.
In [6], the authors gave formulas for the alternating analogues of sums of
Melham for Fibonacci and Lucas numbers of the forms
n
X n
X
(−1)k F2k+δ
2m+ε
and (−1)k L2m+ε
2k+δ ,
k=1 k=1

where ε, δ ∈ {0, 1}.

In this paper, we consider certain binomial sums given by
n   n  
X n 2m+ε
X n 2m+ε
F(2k+δ)t , L ,
k=0
k k=0
k (2k+δ)t
n   n  
X n k 2m+ε
X n
(−1) F(2k+δ)t and (−1)k L(2k+δ)t
2m+ε
,
k=0
k k=0
k

where t is an positive integer and ε, δ ∈ {0, 1}.

Throughout this paper, we use the indicator function [S] defined by 1 if
the statement S is true or 0 otherwise.

We recall some facts for the readers convenience in [4]: For any real
numbers m and n,
t/2−1    
t
X t i t
t−2i t−2i
(mn)t/2 [t is even]


(m + n) = (mn) m +n + (1)
i=0
i t/2

and
t/2−1 
  
t
Xt i i t
t−2i t−2i
(mn)t/2 (−1)t/2 [t is even] .


(m − n) = (mn) (−1) m +n +
i=0
i t/2
(2)
From [7], we have the following result:
Lemma 1.1. Let r and s be arbitrary integers. Then
i)
 (n−1)/2 n
n
X n    5 Fs Lsn+r if n is odd,
n/2 n if s is odd,
Fr+2si = 5 Fs Fsn+r if n is even, (3)
i
Lns Fsn+r if s is even.

i=0
 Formulas for Binomial Sums Including Powers of Fibonacci and Lucas Numbers 3

ii)
 (n+1)/2 n
n  
n  5 Fs Fsn+r if n is odd,
X if s is odd,
Lr+2si = 5n/2 Fsn Lsn+r if n is even, (4)
i  n
i=0 Ls Lsn+r if s is even.

iii)
 n/2 n
n  
n  5 Fs Fsn+r if n is even,
X if s is even,
(−1)i Fr+2si = −5(n−1)/2 n
Fs Lsn+r if n is odd,
i
(−1)n Lns Fsn+r if s is odd.

i=0
(5)
iv)
 n/2 n
n 
n
  5 Fs Lsn+r if n is even,
X if s is even,
(−1)i Lr+2si = −5(n+1)/2 n
Fs Fsn+r if n is odd,
i
(−1)n Lns Lsn+r if s is odd.

i=0
(6)

2. Some Binomial Sums for Fibonacci Numbers

Here we consider binomial and alternating binomial sums of powers of
Fibonacci numbers.

Theorem 2.1. i) For t > 0,

n   m−1    
X n 1 X i 2m 1 2m
2m
F2kt = m (−1) n
L2(m−i)t L2(m−i)tn + m (−1)m 2n .
k=0
k 5 i=0 i 5 m

ii) For odd t > 0,

n  
X n 2m+1
F2kt
k=0
k
 (n−2m) P m
i 2m+1
n


 5 2 (−1) i
F(2m−2i+1)t F(2m−2i+1)tn if n is even,
 i=0
=
 m
 5 (n−2m−1)

2
P
(−1)i 2m+1 F n


L if n is odd,
 i (2m−2i+1)t (2m−2i+1)tn
i=0

and for even t > 0,

n   m  
X n 2m+1 1 X i 2m + 1
F2kt = m (−1) Ln(2m−2i+1)t F(2m−2i+1)tn
k=0
k 5 i=0
i
4 Emrah KILIÇ, Ilker AKKUS, Neşe ÖMÜR, Yücel Türker ULUTAŞ

Proof. i) From the Binet formulas of {Fn } and {Ln } , and by (2), we write

n  
X n 2m
F2kt
k=0
k
n    2kt 2m
X n α − β 2kt
=
k=0
k α−β
n   m−1X 2m
1 X n
(−1)i α2(2m−2i)tk + β 2(2m−2i)tk


= 2m
(α − β) k=0 k i=0
i
  
2m
+ (−1)m
m
m−1  X n     n  
!
1 X 2m n 2m X n
= m (−1)i L2(2m−2i)tk + (−1)m ,
5 i=0
i k=0
k m k=0
k

Pn n


which, by (4) in Lemma 1.1 and since k=0 k = 2n , equivalent to

n   m−1     !
X n 1 X 2m n 2m
2m
F2kt = m (−1)i L2(m−i)t L2(m−i)tn + (−1)m 2n ,
k=0
k 5 i=0
i m

as claimed.
ii) Consider

n  
X n 2m+1
F2kt
k=0
k
n   2kt 2m+1
α − β 2kt

X n
=
k=0
k α−β
n  X m  
1 X n 2m + 1
(−1)i α2(2m+1−2i)tk − β 2(2m+1−2i)tk


= 2m+1
(α − β) k=0
k i=0 i
m  X n  
1 X i 2m + 1 n
= m (−1) F2(2m+1−2i)kt ,
5 i=0 i k=0
k

which, by taking s = (2m + 1 − 2i) t and r = 0 in (3) in Lemma 1.1, gives the
claimed results. 

Following the proof way of Theorem 2.1, we have the following result
without proof:
 Formulas for Binomial Sums Including Powers of Fibonacci and Lucas Numbers 5

Theorem 2.2. i) For t > 0,

n  
X n 2m
F(2k+1)t
k=0
k
m−1    
1 X i(t+1) 2m 1 2m
= m (−1) n
L(2m−2i)t L(2m−2i)t(n+1) + m (−1)(t+1)m 2n .
5 i=0 i 5 m

ii)For odd t > 0,

n  
X n 2m+1
F(2k+1)t
k=0
k
  
m 2m + 1
(n−2m)/2 n
 5 P
F(2m+1−2i)t F(2m+1−2i)t(n+1) if n is even,

i


 i=0
=  

 m 2m + 1
(n−2m−1)/2 n
P
 5 F(2m−2i+1)t L(2m−2i+1)t(n+1) if n is odd,


i=0 i

and, for even t > 0,

n   m  
X n 1 X 2m + 1
2m+1
F(2k+1)t = m (−1)i Ln(2m+1−2i)t F(2m+1−2i)t(n+1) .
k=0
k 5 i=0 i

Theorem 2.3. i) For t > 0,

n  
X n
(−1)k F(2k+1)t
2m

k=0
k
  
(n−2m) m−1 i(t+1) 2m n
P
5 2 (−1) F(2m−2i)t L(2m−2i)t(n+1)


i



  i=0

 2m
(−1)m(t+1) [n = 0]

+ 51m if n is even,

= m



  
(n−2m+1) m−1 i(t+1) 2m


n
P
 −5 2 (−1) F(2m−2i)t F(2m−2i)t(n+1) if n is odd.


i=0 i

ii) For odd t > 0,

n   m 
(−1)n X 2m + 1 n

X n k 2m+1
(−1) F(2k+1)t = L(2m+1−2i)t F(2m+1−2i)t(n+1) ,
k=0
k 5m i=0 i
6 Emrah KILIÇ, Ilker AKKUS, Neşe ÖMÜR, Yücel Türker ULUTAŞ

and, for even t > 0,

n  
X n
(−1)k F(2k+1)t
2m+1

k=0
k
  
m
(n−2m) P i 2m + 1 n
5 2 (−1) F(2m+1−2i)t F(2m+1−2i)t(n+1) if n is even,


i


 i=0
=  
 (n−2m−1) Pm 2m + 1
i
 n
 −5 2 (−1) F(2m+1−2i)t L(2m+1−2i)t(n+1) if n is odd.


i=0 i

Proof. i) For t > 0, by (2), consider

n  
X n
(−1)k F(2k+1)t
2m

k=0
k
n   (2k+1)t 2m
− β (2k+1)t

X n k α
= (−1)
k=0
k α−β
n   m−1
X 2m
1 X n k
= 2m (−1) (−1)i(t+1)
(α − β) k=0 k i=0
i
(2m−2i)t(2k+1) (2m−2i)t(2k+1)


× α +β
  n  
2m m 1 X n
+ (−1) 2m (−1)k (−1)(2k+1)tm
m (α − β) k=0 k
m−1   n  
1 X 2m i(t+1)
X n
= m (−1) (−1)k L(2m−2i)t(2k+1)
5 i=0 i k=0
k
  n  
1 2m X n
+ m (−1)m(t+1) (−1)k ,
5 m k=0
k

Pn n
(−1)k =


which, by taking s = r = (2m − 2i) t in (6) in Lemma 1.1 and k=0 k
[n = 0] , gives the claimed result.
 Formulas for Binomial Sums Including Powers of Fibonacci and Lucas Numbers 7

ii) For t > 0, by (2), consider

n  
X n
(−1)k F(2k+1)t
2m+1

k=0
k
n    (2k+1)t 2m+1
X n k α − β (2k+1)t
= (−1)
k=0
k α−β
n   m  
1 X n k
X 2m + 1
= 2m+1 (−1) (−1)i+ti
(α − β) k=0
k i=0
i
(2m+1−2i)t(2k+1) (2m+1−2i)t(2k+1)


× α −β
m   n  
1 X 2m + 1 i(t+1)
X n
= m (−1) (−1)k F(2m+1−2i)t(2k+1)
5 i=0 i k=0
k
which, by taking s = r = (2m + 1 − 2i) t in (5) in Lemma 1.1, gives the
claimed result. 
Following the proof way of Theorem 2.3, we have the following result:
Theorem 2.4. i)For t > 0,
n  
k n
X
2m
(−1) F2kt
k=0
k
  
(n−2m) m−1 i 2m n
P
5 2 (−1) F2(m−i)t L2(m−i)tn


i



 i=0   if n is even,
 2m
(−1)m [n = 0]

+ 51m

= m



  
(n−2m+1) m−1 2m

i

n
 −5 2 P
(−1) F2(m−i)t F2(m−i)tn if n is odd,

i

i=0

ii) For odd t > 0,

n   m  
k n n 1 i 2m + 1
X X
2m+1
(−1) F2kt = (−1) m (−1) Ln(2m−2i+1)t F(2m−2i+1)tn ,
k=0
k 5 i=0
i
and for even t > 0,
n  
k n
X
2m+1
(−1) F2kt
k=0
k
  
(n−2m) Pm 2m + 1
i n
5 2 (−1) F(2m−2i+1)t F(2m−2i+1)tn if n is even


i


 i=0
=   .
 (n−2m−1) m 2m + 1
(−1)i
 P n
 −5 2 F(2m−2i+1)t L(2m−2i+1)tn if n is odd


i=0 i
8 Emrah KILIÇ, Ilker AKKUS, Neşe ÖMÜR, Yücel Türker ULUTAŞ

3. Binomial Sums and Binomial Alternating Sums for Lucas

Numbers
Now we consider binomial and alternating binomial sums of powers of
Lucas numbers.

Theorem 3.1. i) For t > 0,

n   m−1    
X n 2m X 2m n 2m n
L2kt = L2(m−i)t L2(m−i)tn + 2 .
k=0
k i=0
i m

ii)For even t > 0,

n   m  
X n X 2m + 1 n
L2m+1
2kt = L(2m−2i+1)t L(2m−2i+1)tn ,
k=0
k i=0
i

and, for odd t > 0,

  
m 2m + 1
n/2 n
P
5 F(2m−2i+1)t L(2m−2i+1)tn if n is even,


i

n   
i=0
X n 2m+1 
L =
k=0
k 2kt 
 m

2m + 1

(n+1)/2 n
P
 5 F(2m−2i+1)t F(2m−2i+1)tn if n is odd.


i=0 i

Proof. i) For t > 0, by the Binet formula of {Ln } and (1), we write

n  
X n 2m
L2kt
k=0
k
n  
X n
2m
= α2kt + β 2kt
k=0
k
n   m−1
!
X n X 2m  
2m
α2(2m−2i)tk + β 2(2m−2i)tk + (αβ)2ktm


=
k=0
k i=0
i m
m−1 
X 2m X  n    X n  
n 2m n
= L2(2m−2i)tk + ,
i=0
i k=0
k m k=0
k

which, by taking s = (2m − 2i) t and r = 0 in (4) in Lemma 1.1, gives the
claimed result.
 Formulas for Binomial Sums Including Powers of Fibonacci and Lucas Numbers 9

ii) For t > 0, by the Binet formula of {Ln } and (1), we write

n  
X n
L2m+1
2kt
k=0
k
n  
X n
2m+1
= α2kt + β 2kt
k=0
k
n  X m  
X n 2m + 1
α2(2m+1−2i)tk + β 2(2m+1−2i)tk


=
k=0
k i=0 i
m   n  
X 2m + 1 X n
= L2(2m+1−2i)tk
i=0
i k=0
k

which, by taking s = (2m + 1 − 2i) t and r = 0 in (4) in Lemma 1.1, gives the
claimed result. 

Following the proof way of the previous Theorems, we give the following
results without proof:

Theorem 3.2. i) For t > 0,

n   m−1
X 2m  
X n 2m ti n 2m
L(2k+1)t = (−1) L2(m−i)t L2(m−i)t(n+1) + (−1)tm 2n .
k=0
k i=0
i m

ii) For even t > 0,

n   m  
X n 2m+1 X 2m + 1 n
L = L(2m−2i+1)t L(2m−2i+1)t(n+1) ,
k=0
k (2k+1)t i=0
i

and, for odd t > 0,

n  
X n 2m+1
L(2k+1)t
k=0
k
  
n P
m 2m + 1
52 (−1)i F(2m−2i+1)t
n
L(2m−2i+1)t(n+1) if n is even,


i


 i=0
=  
 (n+1) Pm 2m + 1
(−1)i F(2m−2i+1)t
 n
 5 2 F(2m−2i+1)t(n+1) if n is odd.


i=0 i
10 Emrah KILIÇ, Ilker AKKUS, Neşe ÖMÜR, Yücel Türker ULUTAŞ

Theorem 3.3. i) For t > 0,

n  
X n
(−1)k L2m
2kt
k=0
k
    
m−1 2m
n P 2m
n
52 F(2m−2i)t L(2m−2i)tn + [n = 0] if n is even,


i m


 i=0
=  
(n+1) m−1
P 2m


n
 −5 2 F(2m−2i)t F(2m−2i)tn if n is odd.


i=0 i

ii) For odd t > 0,

n   m  
X n k
Xn 2m + 1 n
(−1) L2m+1
2kt = (−1) L(2m+1−2i)t L(2m+1−2i)tn ,
k=0
k i=0
i

and, for even t > 0,

n  
X n
(−1)k L2m+1
2kt
k=0
k
  
n P
m 2m + 1 n
52 F(2m+1−2i)t L(2m+1−2i)tn if n is even,


i


 i=0
=  

 (n+1) Pm 2m + 1 n
 −5 2 F(2m+1−2i)t F(2m+1−2i)tn if n is odd.


i=0 i

Theorem 3.4. i) For t > 0,

n  
X n
(−1)k L2m
(2k+1)t
k
k=0
  
m−1
P 2m
5n/2
(−1)ti F(2m−2i)t
n
L(2m−2i)t(n+1)


i



 i=0   if n is even,
 2m
(−1)tm [n = 0]

+

= m



  
 m−1
P 2m
(−1)ti F(2m−2i)t

(n+1)/2 n
 −5 F(2m−2i)t(n+1) if n is odd.


i=0 i

ii) For odd t > 0,

n   m  
X n k n
X 2m + 1
(−1) L2m+1
(2k+1)t = (−1) (−1)i Ln(2m+1−2i)t L(2m+1−2i)t(n+1) ,
k=0
k i=0
i
 Formulas for Binomial Sums Including Powers of Fibonacci and Lucas Numbers 11

and, for even t > 0,

n  
X n
(−1)k L2m+1
(2k+1)t
k=0
k
  
n P
m 2m + 1 n
52 F(2m+1−2i)t L(2m+1−2i)t(n+1) if n is even,


i


 i=0
=  

 (n+1) Pm 2m + 1 n
 −5 2 F(2m+1−2i)t F(2m+1−2i)t(n+1) if n is odd.


i=0 i
REFERENCES
[1]
[2] K. Ozeki, On Melham’s sum,The Fibonacci Quarterly, 46-47(2) (2008-2009),107–110.
[3] H. Prodinger, On a sum of Melham and its variants, The Fibonacci Quarterly, 46-47(3)
(2008-2009), 207–215.
[4] S. Vajda, Fibonacci & Lucas numbers, and the golden section. Theory and applications.
John Wiley & Sons, Inc., New York, 1989.
[5] M. Wiemann and C. Cooper, Divisibility of an F –L type convolution. Applications of
Fibonacci Numbers, 9 (2004), 267–287.
[6] E. Kılıç, N. Ömür and Y. T. Ulutaş, Alternating sums of the powers of Fibonacci and
Lucas numbers, Miskolc Math. Notes, Vol. 12 (2011), No. 1, 87–103.
[7] E. Kılıç, N. Ömür and Y. T. Ulutaş, Binomial sums whose coefficients are products of
terms of binary sequences, Utilitas Math., 84 (2011), 45–52.

View publication stats