Documente Academic
Documente Profesional
Documente Cultură
Fibonacci Sums
Arthur T. Benjamin
Dept. of Mathematics, Harvey Mudd College, Claremont, CA 91711
benjamin@hmc.edu
Judson D. Neer
Dept. of Science and Mathematics, Cedarville University, 251 N. Main St., Cedarville,
OH 45314-0601
jud@poboxes.com
Daniel E. Otero
Dept. of Mathematics and Computer Science, Xavier University, Cincinnati, OH
45207-4441
otero@xu.edu
James A. Sellers
Dept. of Mathematics, Penn State University, University Park, PA 16802
sellersj@math.psu.edu
Introduction
k n Fk
.
k+1
k1 2
X
(1)
d
For any given n, such a sum can be determined [3] by applying the x dx
operator
Fk xk =
k1
x
,
1 x x2
Probabilistic Interpretation
Fk
.
2k+1
k n Fk
.
k+1
k1 2
X
(2)
E(Y ) =
since E(Y 0 ) = E(Y 00 ) = E(Y ). Solving for E(Y ) gives us E(Y ) = 5. Hence,
a1 =
kFk
= 5.
k+1
k1 2
X
E(Y 2 ) =
k 2 Fk
= 47.
k+1
k1 2
X
E(Y n ) =
n1
X
n
k
[2 + 2nk ]E(Y k )
k=0
n1
X
n
k
[2 + 2nk ]ak .
(3)
k=0
Using equation (3), one can easily derive a3 = 665, a4 = 12, 551, and so on.
an n
x .
n0 n!
X
1+
Pn1 n
k=0
[2 + 2nk ]ak
n!
n1
xn
ex
.
4 2ex e2x
(4)
For the asymptotic growth of an , one need only look at the leading term of
the Laurent series expansion [4] of a(x). This leads to
!n+1
51
1
an
n!.
10 2 5 ln( 5 1)
(5)
Closed Form
While the recurrence (3), generating function (4), and asymptotic result (5) are
satisfying, a closed form for an might also be desired. For the sake of completeness,
we demonstrate such a closed form here.
To calculate
an =
k n Fk
,
k+1
k1 2
X
!k
!k
1 1+ 5
1 5
Fk =
2
2
5
Then (6) implies that (1) can be rewritten as
!k
!k
1 X n 1+ 5
1 X n 1 5
an =
k
k
.
4
4
2 5 k1
2 5 k1
5
(6)
(7)
xk =
k0
1
1x
(8)
d
This holds for all real numbers x such that |x| < 1. We now apply the x dx
operator
n times to (8). It is clear that the left-hand side of (8) will then become
X
k n xk .
k1
e(n, j)xj ,
n+1
(1 x)
j=1
(9)
where the coefficients e(n, j) are the Eulerian numbers [2, Sequence A008292],
defined by
e(n, j) = j e(n 1, j) + (n j + 1) e(n 1, j 1) with e(1, 1) = 1.
(The fact that these are indeed the coefficients of the polynomial in the numerator
of (9) can be proven quickly by induction.) From the information found in [2,
Sequence A008292], we know
e(n, j) =
j
X
(1)` (j `)n
n+1
`
`=0
Therefore,
j
n
X
X
1
(1)` (j `)n n+1 xj .
k n xk =
`
(1 x)n+1 j=1 `=0
k1
(10)
k1
!k
!k
X
1+ 5
5
n 1
k
and
4
4
k1
< 1 and
1 5
4
< 1.
References
[1] A. T. Benjamin and J. J. Quinn, Recounting Fibonacci and Lucas Identities,
College Mathematics Journal, Vol. 30, No. 5, pp. 359-366, 1999.
[2] N. J. A. Sloane, The On-Line Encyclopedia of Integer Sequences, published
electronically at http://www.research.att.com/njas/sequences/, 2000.
[3] S. Vajda, Fibonacci and Lucas Numbers, and the Golden Section, John
Wiley and Sons, New York, 1989.
[4] H. S. Wilf, Generatingfunctionology, Academic Press, Boston, 1994.